{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^{18}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"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$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}