No tag edit access

A. Complicated GCD

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard 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, 10^{100} — such number do not fit even in 64-bit integer type!

Input

The only line of the input contains two integers *a* and *b* (1 ≤ *a* ≤ *b* ≤ 10^{100}).

Output

Output one integer — greatest common divisor of all integers from *a* to *b* inclusive.

Examples

Input

1 2

Output

1

Input

61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576

Output

61803398874989484820458683436563811772030917980576

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/27/2017 22:17:04 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|