Problem Statement 
 We want to be able to express a fraction as a sum of two fractions that have small denominators.
Specifically, given a fraction a/b, we want to find fractions c/d and e/f such that
a/b = c/d + e/f, where d and f are positive

max(d,f) is as small as possible
Create a class FracSum that contains a method decompose that is given a and b and that returns
the smallest value for max(d,f).


Definition 
 Class:  FracSum  Method:  decompose  Parameters:  int, int  Returns:  int  Method signature:  int decompose(int a, int b)  (be sure your method is public) 




Constraints 
  a and b will each be between 1 and 2,000,000,000, inclusive. 

Examples 
0)  
  Returns: 5 
14/10 = 0/1 + 7/5 is one way to keep the denominators less than or equal to 5.



1)  
 
2)  
 