{"trustable":true,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e$\\textbf{Note:There is no dependency between this problem and problem Multiply 2 Divide 2.}$\u003cbr\u003e\u003cbr\u003eFrank_DD has a sequence $a$ of length $n(1 \\leq n \\leq 10^5,1 \\leq a_i \\leq 10^5)$.\u003cbr\u003e\u003cbr\u003eFor each operation, he selects a number $a_i(1 \\le i \\le n)$ and changes it to $a_i\\cdot 2$ or $\\lfloor \\frac{a_i}{2} \\rfloor$.\u003cbr\u003e\u003cbr\u003eFrank_DD wants to know the minimum number of operations to change the sequence $a$ to a non-descending sequence.\u003cbr\u003e\u003cbr\u003eTo help Frank_DD solve this problem, ddy guesses that the number in the result sequence can\u0027t be very large, and it will not exceed $2^{127}-1$, which means that every number in the result sequence can be held in a 128-bit signed integer variable.\u003cbr\u003e\u003cbr\u003eFormally, he guesses that for each sequence $a$ that satisfies the constraints, there will always be a way that the number of operations is minimal, and in the result sequence, $a_n\u0026lt;2^{127}$.\u003cbr\u003e\u003cbr\u003eSo, he writes a program relying on this idea. \u003cbr\u003e\u003cbr\u003eBut unfortunately, the idea is wrong, so this program can be hacked. \u003cbr\u003e\u003cbr\u003eNow you should construct a sequence to hack the program of ddy. Your solution is considered correct if and only if this sequence satisfies the constraints, and the idea of ddy is wrong to this sequence.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"This problem has no input."}},{"title":"Output","value":{"format":"HTML","content":"The first line contains a single integer $n(1 \\leq n \\leq 10^5)$ --- the length of sequence $a$. \u003cbr\u003e\u003cbr\u003eThe second line contains $n$ integers $a_1, a_2, \\ldots, a_n$ $(1 \\leq a_i \\leq 10^5)$ --- the sequence $a$.\u003cbr\u003e"}},{"title":"Sample","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\u003eThis problem has no input.\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e7\r\n6 3 3 4 10 8 2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003eFor example, if your output is \u003cbr\u003e\u003cbr\u003e7\u003cbr\u003e\u003cbr\u003e6 3 3 4 10 8 2\u003cbr\u003e\u003cbr\u003eWe can use at least $4$ operations to change the sequence $a$ to a non-descending sequence:\u003cbr\u003e\u003cbr\u003e$a_1\u003d\\lfloor \\frac{a_1}{2} \\rfloor$\u003cbr\u003e\u003cbr\u003e$a_5\u003d\\lfloor \\frac{a_5}{2} \\rfloor$\u003cbr\u003e\u003cbr\u003e$a_7\u003da_7 \\cdot 2$\u003cbr\u003e\u003cbr\u003e$a_7\u003da_7 \\cdot 2$\u003cbr\u003e\u003cbr\u003eIn this way, in the result sequence, $a_n\u003d8\u0026lt;2^{127}$. So you will get wrong answer.\u003cbr\u003e"}}]}