Description

Find the greatest common divisor (GCD) of two positive integers m and n.

Input Format

Input m and n.

Output Format

Output the greatest common divisor of m and n. For all test cases: m, n < 1000000.

Sample

4 6

2