{"problem":{"name":"Multiple of 7","description":{"content":"Given is an integer $N$. Find one string $s$ consisting of `1`, `2`, $\\cdots$, `9` that satisfies the conditions below. *   The length of $s$, $|s|$, is at most $10^6$. *   There are exactly $N$ pair","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc129_c"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^6$\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":"arc129_c","tags":[],"sample_group":[["2","142\n\nTwo pairs $(l,r)=(1,2),(2,3)$ satisfy the conditions."],["3","77\n\nThree pairs $(l,r)=(1,1),(2,2),(1,2)$ satisfy the conditions."]],"created_at":"2026-03-03 11:01:14"}}