GCD (Greatest Common Divisor) between a and b is the greatest number n where both a and b are divisible by n.

Input

Input contains 2 number a b where 1<=a, b<=100000

Output

Print the GCD between a and b. Print endl after the test case.

Example

Input:
6 8

Output:
2