{"problem":{"name":"Calculator","description":{"content":"Snuke has integers $x$ and $y$. Initially, $x=0,y=0$. Snuke can do the following four operations any number of times in any order: *   Operation $1$: Replace the value of $x$ with $x+1$.      *   Ope","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc122_c"},"statements":[{"statement_type":"Markdown","content":"Snuke has integers $x$ and $y$. Initially, $x=0,y=0$.\nSnuke can do the following four operations any number of times in any order:\n\n*   Operation $1$: Replace the value of $x$ with $x+1$.\n    \n*   Operation $2$: Replace the value of $y$ with $y+1$.\n    \n*   Operation $3$: Replace the value of $x$ with $x+y$.\n    \n*   Operation $4$: Replace the value of $y$ with $x+y$.\n    \n\nYou are given a positive integer $N$. Do at most $130$ operations so that $x$ will have the value $N$. Here, $y$ can have any value. We can prove that such a sequence of operations exists under the constraints of this problem.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^{18}$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc122_c","tags":[],"sample_group":[["4","5\n1\n4\n2\n3\n1\n\nHere, the values of $x$ and $y$ change as follows: $(0,0)\\rightarrow$ (Operation $1$) $\\rightarrow (1,0) \\rightarrow$ (Operation $4$) $\\rightarrow (1,1) \\rightarrow$ (Operation $2$) $\\rightarrow (1,2) \\rightarrow$ (Operation $3$) $\\rightarrow (3,2) \\rightarrow$ (Operation $1$) $\\rightarrow (4,2)$, and the final value of $x$ matches $N$."]],"created_at":"2026-03-03 11:01:14"}}