{"raw_statement":[{"iden":"problem statement","content":"There are $N$ positive integers $A_1, A_2, ..., A_N$. Takahashi can perform the following operation on these integers any number of times:\n\n*   Choose $1 \\leq i \\leq N$ and multiply the value of $A_i$ by $-2$.\n\nNotice that he multiplies it by **minus** two.\nHe would like to make $A_1 \\leq A_2 \\leq ... \\leq A_N$ holds. Find the minimum number of operations required. If it is impossible, print `-1`."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 200000$\n*   $1 \\leq A_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$"},{"iden":"sample input 1","content":"4\n3 1 4 1"},{"iden":"sample output 1","content":"3\n\nOne possible solution is:\n\n*   Choose $i=4$ and multiply the value of $A_4$ by $-2$. $A_1, A_2, A_3, A_4$ are now $3, 1, 4, -2$.\n*   Choose $i=1$ and multiply the value of $A_1$ by $-2$. $A_1, A_2, A_3, A_4$ are now $-6, 1, 4, -2$.\n*   Choose $i=4$ and multiply the value of $A_4$ by $-2$. $A_1, A_2, A_3, A_4$ are now $-6, 1, 4, 4$."},{"iden":"sample input 2","content":"5\n1 2 3 4 5"},{"iden":"sample output 2","content":"0\n\n$A_1 \\leq A_2 \\leq ... \\leq A_N$ holds before any operation is performed."},{"iden":"sample input 3","content":"8\n657312726 129662684 181537270 324043958 468214806 916875077 825989291 319670097"},{"iden":"sample output 3","content":"7"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}