{"raw_statement":[{"iden":"problem statement","content":"Given is an integer $N$.\nFind one string $s$ consisting of `1`, `2`, $\\cdots$, `9` that satisfies the conditions below.\n\n*   The length of $s$, $|s|$, is at most $10^6$.\n*   There are exactly $N$ pairs of integers $(l,r)$ ($1 \\leq l \\leq r \\leq |s|$) that satisfy the following condition.\n    *   When the $l$\\-th through $r$\\-th characters of $s$ are extracted and seen as a number, it is divisible by $7$.\n\nUnder the Constraints of this problem, we can prove that a solution always exists."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^6$\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":"2"},{"iden":"sample output 1","content":"142\n\nTwo pairs $(l,r)=(1,2),(2,3)$ satisfy the conditions."},{"iden":"sample input 2","content":"3"},{"iden":"sample output 2","content":"77\n\nThree pairs $(l,r)=(1,1),(2,2),(1,2)$ satisfy the conditions."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}