#include <iostream>
#include <vector>
using namespace std;

int main(){
    int n; cin >> n;
    vector<long>list(n);
    for (int i = 0; i < n; i++)
        cin >> list[i];
    long max = 0;
    for (int i = 0; i < n; i++)
    {
        if (list[i] > max)
            max = list[i];
    }
    
    vector<long>levels;
    long previous = 1;
    levels.push_back(1);
    long temp = 2;
    while (previous + temp < max) {
        levels.push_back(previous + temp);
        previous = previous + temp;
        temp = temp *2;
    }
    levels.push_back(previous + temp);
    int j;
    long counter = 0;
    for (int i = 0; i < n; i++) {
        j = 0;
        while (list[i] > levels[j])
            j++;
        counter += levels[j] - list[i];
    }
    
    cout << counter;
}