It is audit day at the quays of Driftwood. Isha spreads the runes records across the table and picks up a sharp pencil. Task: Read two positive integers a and b and print their greatest common divisor. Input format: One line with two space-separated integers a and b. Output format: Print gcd(a, b). Constraints: 1 <= a,b <= 1000000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= a,b <= 1000000000000.
