{"raw_statement":[{"iden":"problem statement","content":"Given are integers $A$ and $B$. Find the maximum possible value of $\\gcd(x, y)$ when we choose integers $x$ and $y$ so that $A ≤ x < y ≤ B$.  \nHere, $\\gcd(x, y)$ denotes the greatest common divisor of $x$ and $y$."},{"iden":"constraints","content":"*   $A$ and $B$ are integers.\n*   $1 ≤ A < B ≤ 2 \\times 10^5$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$"},{"iden":"sample input 1","content":"2 4"},{"iden":"sample output 1","content":"2\n\nWe have three ways to choose $(x, y)$ such that $A ≤ x < y ≤ B$: $(2,3), (2,4), (3,4)$, where the greatest common divisors are $1, 2, 1$, respectively, so the maximum possible value is $2$."},{"iden":"sample input 2","content":"199999 200000"},{"iden":"sample output 2","content":"1\n\nWe have $\\gcd(199999, 200000) = 1$."},{"iden":"sample input 3","content":"101 139"},{"iden":"sample output 3","content":"34"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}