409218: GYM103462 J Jew Sorting

Hello, guys, I am the King of boredom.

I have a array of length $$$2^k(0 \leq k \leq 20)$$$. You can delete the first half or the second half of each operation.

So, you need to tell me the minimum number of operations required can make this sequence non-decreasing.

The first line contains a single integer $$$k(0 \leq k \leq 20)$$$, denoting the length of the array is $$$2^k$$$.

The second line contains $$$2^k$$$ integers, the $$$i$$$-th integer is $$$a_i(1 \leq a_i \leq 10^9)$$$ representing the array.

Print a single integer, denoting the answer.

2
1 3 2 1

1

2
1 2 3 4

0