{"problem":{"name":"Squeezing Slimes","description":{"content":"There are $A$ slimes lining up in a row. Initially, the sizes of the slimes are all $1$. Snuke can repeatedly perform the following operation. *   Choose a positive even number $M$. Then, select $M$ ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"code_festival_2017_quala_f"},"statements":[{"statement_type":"Markdown","content":"There are $A$ slimes lining up in a row. Initially, the sizes of the slimes are all $1$.\nSnuke can repeatedly perform the following operation.\n\n*   Choose a positive even number $M$. Then, select $M$ consecutive slimes and form $M / 2$ pairs from those slimes as follows: pair the $1$\\-st and $2$\\-nd of them from the left, the $3$\\-rd and $4$\\-th of them, $...$, the $(M-1)$\\-th and $M$\\-th of them. Combine each pair of slimes into one larger slime. Here, the size of a combined slime is the sum of the individual slimes before combination. The order of the $M / 2$ combined slimes remain the same as the $M / 2$ pairs of slimes before combination.\n\nSnuke wants to get to the situation where there are exactly $N$ slimes, and the size of the $i$\\-th ($1 ≤ i ≤ N$) slime from the left is $a_i$. Find the minimum number of operations required to achieve his goal.\nNote that $A$ is not directly given as input. Assume $A = a_1 + a_2 + ... + a_N$.\n\n## Constraints\n\n*   $1 ≤ N ≤ 10^5$\n*   $a_i$ is an integer.\n*   $1 ≤ a_i ≤ 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"code_festival_2017_quala_f","tags":[],"sample_group":[["2\n3 3","2\n\nOne way to achieve Snuke's goal is as follows. Here, the selected slimes are marked in bold.\n\n*   (1, **1**, **1**, **1**, **1**, 1) → (1, **2**, **2**, 1)\n*   (**1**, **2**, **2**, **1**) → (**3**, **3**)"],["4\n2 1 2 2","2\n\nOne way to achieve Snuke's goal is as follows.\n\n*   (**1**, **1**, 1, 1, 1, 1, 1) → (**2**, 1, 1, 1, 1, 1)\n*   (2, 1, **1**, **1**, **1**, **1**) → (2, 1, **2**, **2**)"],["1\n1","0"],["10\n3 1 4 1 5 9 2 6 5 3","10"]],"created_at":"2026-03-03 11:01:14"}}