A. Complicated GCDtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGreatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are divisible by d. There are many efficient algorithms to find greatest common divisor GCD(a, b), for example, Euclid algorithm. Formally, find the biggest integer d, such that all integers a, a + 1, a + 2, ..., b are divisible by d. To make the problem even more complicated we allow a and b to be up to googol, 10100 — such number do not fit even in 64-bit integer type!InputThe only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10100).OutputOutput one integer — greatest common divisor of all integers from a to b inclusive.ExamplesInput1 2Output1Input61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576Output61803398874989484820458683436563811772030917980576
Input1 2
Output1
['math', 'number theory', '*800']