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.

Challenge

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

Example of input

426
132
120

Example of output for this input

6

Example of input:

100
60
120

Example of output for this input

20

Example of input:

4
8
12

Example of output for this input

4