GCD of Two Numbers
Find the greatest common divisor of two numbers.
Input format
One line with two integers A and B (both >= 1).
Output format
Print the greatest common divisor of A and B.
Constraints
- Values fit in a 64-bit signed integer
- Trailing whitespace and a trailing newline are ignored by the judge
Read from stdin, write to stdout. Sample cases below show the exact format.
Sample cases
Example 1
Input
12 18Expected output
6Example 2
Input
7 13Expected output
1