It is said that the greatest common divisor (GCD) of two or more whole integers, is the largest integer that divides them without leaving residue. Euclid's algorithm is famous for allowing to find the GCD between two integers. This challenge asks you, you find the GCD between three integers.

The entry consists of 3 whole non-negative integers (< 2⁶⁴), one per line and the output will be the GCD of the three integers.

Examples

Input:
426
132
120
Output:
6

Input:
100
60
120

Output:
20

Input:
4
8
12

Output:
4