#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

int calc(vector<pair<int,int> >a){
    int n = a.size();
    if(n==0)return 0;
    vector<pair<int,int> > b;
    int sm = 0;
    rep(i,n){
        if(a[i]==MP(0,0)){
            sm += calc(b);
            b.clear();
        }else{
            b.push_back(a[i]);
        }
    }
    if(b.size()!=n){
        sm += calc(b);
        return sm;
    }
    bool flag = 0;
    rep(i,n){
        if(b[i]!=MP(1,0)){
            if(!flag){
                flag = 1;
                sm++;
            }
            b[i] = MP(b[i].first-1,b[i].second-1);
        }else{
            if(flag){
                flag = 0;
                b[i] = MP(0,0);
            }else{
                flag = 1;
                b[i] = MP(0,0);
                sm++;
            }
        }
    }
    return sm + calc(b);
}

int main(){
    int n;
    cin >> n;
    vector<int> s(n);
    rep(i,n){
        cin >> s[i];
    }
    vector<pair<int,int> > a(n);
    rep(i,n){
        int k = 1;
        int c = 0;
        while(k*2<=s[i]){
            k *= 2;
            c++;
        }
        if(k==s[i]){
            a[i] = MP(c,c);
        }else{
            a[i] = MP(c+1,c);
        }
    }
    cout << calc(a) << endl;
    return 0;
}
### Prompt

In CPP, your task is to solve the following problem:

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 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.



Snuke 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.

Note that A is not directly given as input. Assume A = a_1 + a_2 + ... + a_N.

Constraints

* 1 ≤ N ≤ 10^5
* a_i is an integer.
* 1 ≤ a_i ≤ 10^9

Input

Input is given from Standard Input in the following format:


N
a_1 a_2 ... a_N


Output

Print the minimum number of operations required to achieve Snuke's goal.

Examples

Input

2
3 3


Output

2


Input

4
2 1 2 2


Output

2


Input

1
1


Output

0


Input

10
3 1 4 1 5 9 2 6 5 3


Output

10

### Response

```cpp
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

int calc(vector<pair<int,int> >a){
    int n = a.size();
    if(n==0)return 0;
    vector<pair<int,int> > b;
    int sm = 0;
    rep(i,n){
        if(a[i]==MP(0,0)){
            sm += calc(b);
            b.clear();
        }else{
            b.push_back(a[i]);
        }
    }
    if(b.size()!=n){
        sm += calc(b);
        return sm;
    }
    bool flag = 0;
    rep(i,n){
        if(b[i]!=MP(1,0)){
            if(!flag){
                flag = 1;
                sm++;
            }
            b[i] = MP(b[i].first-1,b[i].second-1);
        }else{
            if(flag){
                flag = 0;
                b[i] = MP(0,0);
            }else{
                flag = 1;
                b[i] = MP(0,0);
                sm++;
            }
        }
    }
    return sm + calc(b);
}

int main(){
    int n;
    cin >> n;
    vector<int> s(n);
    rep(i,n){
        cin >> s[i];
    }
    vector<pair<int,int> > a(n);
    rep(i,n){
        int k = 1;
        int c = 0;
        while(k*2<=s[i]){
            k *= 2;
            c++;
        }
        if(k==s[i]){
            a[i] = MP(c,c);
        }else{
            a[i] = MP(c+1,c);
        }
    }
    cout << calc(a) << endl;
    return 0;
}
```