{"raw_statement":[{"iden":"problem statement","content":"We have variables $a$ and $b$. Initially, $a=A$ and $b=B$.\nTakahashi will repeat the following operation while both $a$ and $b$ are greater than or equal to $1$.\n\n*   Let $g$ be the greatest common divisor of $a$ and $b$, and replace $a$ and $b$ with $a-g$ and $b-g$, respectively.\n\nHow many times will he perform the operation?"},{"iden":"constraints","content":"*   $1 \\leq A,B \\leq 10^{12}$\n*   $A$ and $B$ are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$A$ $B$"},{"iden":"sample input 1","content":"15 9"},{"iden":"sample output 1","content":"2\n\nWe start with $a=15,b=9$ and perform the following.\n\n*   Let $g=3$, and replace $a$ and $b$ with $12(=15-3)$ and $6(=9-3)$, respectively.\n*   Let $g=6$, and replace $a$ and $b$ with $6(=12-6)$ and $0(=6-6)$, respectively. $b$ is no longer greater than or equal to $1$, so the iteration terminates."},{"iden":"sample input 2","content":"1 1"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"12345678910 10987654321"},{"iden":"sample output 3","content":"36135"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}