{"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\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eSetsuna is almost out of money! Therefore, she always thinks about ways to get rich overnight. \u003c/p\u003e\u003cp\u003eShe finds that buying lottery tickets is a wonderful choice, and she decides to use her lucky number as the lottery number.\u003c/p\u003e\u003cp\u003eSetsuna uses some unique methods to pick her lucky numbers. She will first select $$$n$$$ magic cards. Each card is written with a digit between $$$0$$$ and $$$9$$$ inclusively. Then she will use some cards to construct a number. She believes that the largest number she can construct which can be divided by 4 is her lucky number.\u003c/p\u003e\u003cp\u003eIt is unnecessary to use all the cards, and it is possible that such lucky number does not exist.\u003c/p\u003e\u003cp\u003eBecause she is daydreaming of getting rich, only you can help her find this lucky number.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe input consists of multiple test cases. \u003c/p\u003e\u003cp\u003eThe first line contains a single integer $$$t(1 \\leq t \\leq 3 \\times 10^5)$$$, indicating the number of test cases.\u003c/p\u003e\u003cp\u003eEach of the next $$$t$$$ lines contains $$$10$$$ integers $$$c_0,c_1,\\cdots,c_{9}(0 \\leq c_i \\leq 10^5,\\sum_{i\u003d0}^9 c_i \u0026gt; 0)$$$, where $$$c_i$$$ indicates the number of cards written with number $$$i$$$.\u003c/p\u003e\u003cp\u003eIt is guaranteed that the sum of $$$\\sum_{i\u003d0}^9 c_i$$$ of all test cases does not exceed $$$3 \\times 10^5$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case given in the input, print the lucky number(without leading zero) or $$$-1$$$ if such lucky number does not exist.\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\u003e6\n0 1 1 0 0 0 0 0 0 0\n0 0 0 0 1 0 0 0 0 0\n1 0 0 2 0 0 0 0 0 0\n2 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e12\n4\n0\n98765432100\n9876543120\n987654312\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}