Recurring Sequence In A Fraction

hard
Question Solve Solutions 
1. You are given two numbers which represent the numerator and denominator of a fraction.
2. You have to convert this fraction into a decimal.
3. If the decimals are repeating recursively, then you have to put the recurring sequence inside a bracket.

Input Format

A number N1 representing the numerator of a fraction. A number N2 representing the denominator of a fraction.

Output Format

A String representing a decimal number.

Constraints

1 <= N1,N2 <= 2000

Example

Input
8
4
Output
2
Previous
Pairs With Equal Sum
Next
Rabbits In The Forest

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String