Greatest common divisorGCD(a, b)of two positive integersaandbis equal to the biggest integerdsuch that both integersaandbare divisible byd. There are many efficient algorithms to find greatest common divisorGCD(a, b), for example, Euclid algorithm.Formally, find the biggest integerd, such that all integersa, a + 1, a + 2, ..., bare divisible byd. To make the problem even more complicated we allowaandbto be up to googol,10100— such number do not fit even in 64-bit integer type!
The only line of the input contains two integersaandb(1 ≤ a ≤ b ≤ 10100).
Output one integer— greatest common divisor of all integers fromatobinclusive.
input61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576