{"problem":{"name":"Collatz Problem","description":{"content":"A sequence $a={a_1,a_2,a_3,......}$ is determined as follows: *   The first term $s$ is given as input.      *   Let $f(n)$ be the following function: $f(n) = n/2$ if $n$ is even, and $f(n) = 3n+1$ i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc116_b"},"statements":[{"statement_type":"Markdown","content":"A sequence $a={a_1,a_2,a_3,......}$ is determined as follows:\n\n*   The first term $s$ is given as input.\n    \n*   Let $f(n)$ be the following function: $f(n) = n/2$ if $n$ is even, and $f(n) = 3n+1$ if $n$ is odd.\n    \n*   $a_i = s$ when $i = 1$, and $a_i = f(a_{i-1})$ when $i > 1$.\n    \n\nFind the minimum integer $m$ that satisfies the following condition:\n\n*   There exists an integer $n$ such that $a_m = a_n (m > n)$.\n\n## Constraints\n\n*   $1 \\leq s \\leq 100$\n*   All values in input are integers.\n*   It is guaranteed that all elements in $a$ and the minimum $m$ that satisfies the condition are at most $1000000$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$s$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc116_b","tags":[],"sample_group":[["8","5\n\n$a={8,4,2,1,4,2,1,4,2,1,......}$. As $a_5=a_2$, the answer is $5$."],["7","18\n\n$a={7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......}$."],["54","114"]],"created_at":"2026-03-03 11:01:14"}}