{"raw_statement":[{"iden":"problem statement","content":"We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller.\n\n*   Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by $N$, and increase each of the other elements by $1$.\n\nIt can be proved that the largest element in the sequence becomes $N-1$ or smaller after a finite number of operations.\nYou are given an integer $K$. Find an integer sequence $a_i$ such that the number of times we will perform the above operation is exactly $K$. It can be shown that there is always such a sequence under the constraints on input and output in this problem."},{"iden":"constraints","content":"*   $0 ≤ K ≤ 50 \\times 10^{16}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$"},{"iden":"sample input 1","content":"0"},{"iden":"sample output 1","content":"4\n3 3 3 3"},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"3\n1 0 3"},{"iden":"sample input 3","content":"2"},{"iden":"sample output 3","content":"2\n2 2\n\nThe operation will be performed twice: \\[2, 2\\] -> \\[0, 3\\] -> \\[1, 1\\]."},{"iden":"sample input 4","content":"3"},{"iden":"sample output 4","content":"7\n27 0 0 0 0 0 0"},{"iden":"sample input 5","content":"1234567894848"},{"iden":"sample output 5","content":"10\n1000 193 256 777 0 1 1192 1234567891011 48 425"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}