{"trustable":false,"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":"PLAIN","content":"Ayat is a first-semester student of IIUC. Recently he learn about the theory of sorting algorithms in the class of Jamil sir.\nAfter studying the theory, he went on to the practical tasks.\nAs a result, he wrote a program that sorts an array of n integers a1, a2, ..., an in the non-decreasing order.\nThe pseudocode of the program, written by Ayat, is given below. The input of the program gets number n and array a.\n\nfor(i \u003d 1; i \u003c n; i++)\n{\n for(j \u003d i; j \u003c n; j++)\n {\n if(a[j] \u003e a[j+1])\n {\n swap(a[j], a[j+1])\n }\n }\n }\nBut Ayat could have made a mistake, because he hasn\u0027t yet fully learned the sorting algorithm.\nIf Ayat made a mistake in his program, you need to give a counter-example that makes his program work\nimproperly (that is, the example that makes the program sort the array not in the non-decreasing order).\nIf such example for the given value of n doesn\u0027t exist, print -1."}},{"title":"Input","value":{"format":"PLAIN","content":"Given an integer n (1 ≤ n ≤ 50)."}},{"title":"Output","value":{"format":"PLAIN","content":"Print n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 100) — the counter-example, for which Ayat\u0027s algorithm won\u0027t work correctly. If the counter-example that meets the described conditions is impossible to give, print -1."}},{"title":"Examples","value":{"format":"PLAIN","content":"input:\n4\noutput:\n3 2 1 1"}}]}