{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\u003cspan class\u003d\"tex-font-style-it\"\u003eThe subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.\u003c/span\u003e\u003c/p\u003e\u003cp\u003eYou are given an integer $$$n$$$. \u003c/p\u003e\u003cp\u003eYou have to find a sequence $$$s$$$ consisting of digits $$$\\{1, 3, 7\\}$$$ such that it has exactly $$$n$$$ subsequences equal to $$$1337$$$.\u003c/p\u003e\u003cp\u003eFor example, sequence $$$337133377$$$ has $$$6$$$ subsequences equal to $$$1337$$$: \u003c/p\u003e\u003col\u003e \u003cli\u003e $$$337\\underline{1}3\\underline{3}\\underline{3}7\\underline{7}$$$ (you can remove the second and fifth characters); \u003c/li\u003e\u003cli\u003e $$$337\\underline{1}\\underline{3}3\\underline{3}7\\underline{7}$$$ (you can remove the third and fifth characters); \u003c/li\u003e\u003cli\u003e $$$337\\underline{1}\\underline{3}\\underline{3}37\\underline{7}$$$ (you can remove the fourth and fifth characters); \u003c/li\u003e\u003cli\u003e $$$337\\underline{1}3\\underline{3}\\underline{3}\\underline{7}7$$$ (you can remove the second and sixth characters); \u003c/li\u003e\u003cli\u003e $$$337\\underline{1}\\underline{3}3\\underline{3}\\underline{7}7$$$ (you can remove the third and sixth characters); \u003c/li\u003e\u003cli\u003e $$$337\\underline{1}\\underline{3}\\underline{3}3\\underline{7}7$$$ (you can remove the fourth and sixth characters). \u003c/li\u003e\u003c/ol\u003e\u003cp\u003e\u003cspan class\u003d\"tex-font-style-bf\"\u003eNote that the length of the sequence $$$s$$$ must not exceed $$$10^5$$$.\u003c/span\u003e\u003c/p\u003e\u003cp\u003eYou have to answer $$$t$$$ independent queries.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains one integer $$$t$$$ ($$$1 \\le t \\le 10$$$) — the number of queries. \u003c/p\u003e\u003cp\u003eNext $$$t$$$ lines contains a description of queries: the $$$i$$$-th line contains one integer $$$n_i$$$ ($$$1 \\le n_i \\le 10^9$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor the $$$i$$$-th query print one string $$$s_i$$$ ($$$1 \\le |s_i| \\le 10^5$$$) consisting of digits $$$\\{1, 3, 7\\}$$$. String $$$s_i$$$ must have exactly $$$n_i$$$ subsequences $$$1337$$$. If there are multiple such strings, print any of them.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n6\n1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e113337\n1337\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}