{"problem":{"name":"C. Maximum Number","description":{"content":"Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below. <center>![image](h","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF774C"},"statements":[{"statement_type":"Markdown","content":"Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.\n\n<center>![image](https://espresso.codeforces.com/1b26f8faef5a8a5117060246d28eb2aea6e5ebe8.png)</center>So, for example, to show the digit 3 on the display, 5 sections must be highlighted; and for the digit 6, 6 sections must be highlighted.\n\nThe battery of the newest device allows to highlight at most _n_ sections on the display.\n\nStepan wants to know the maximum possible integer number which can be shown on the display of his newest device. Your task is to determine this number. Note that this number must not contain leading zeros. Assume that the size of the display is enough to show any integer.\n\n## Input\n\nThe first line contains the integer _n_ (2 ≤ _n_ ≤ 100 000) — the maximum number of sections which can be highlighted on the display.\n\n## Output\n\nPrint the maximum integer which can be shown on the display of Stepan's newest device.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"CF774C","tags":["constructive algorithms","greedy","implementation"],"sample_group":[["2","1"],["3","7"]],"created_at":"2026-03-03 11:00:39"}}