#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rp(i,a,b)        for(int i=a;i<b;i++)

void solvetask(){
    int n;
    cin >> n;
    vector<int> nums(n);
    rp(i, 0, n) cin >> nums[i];
    ll resp = 1e18, comp = 0;

    rp(i, 0, n) comp += abs(nums[i]-i);
    comp /= 2;
    resp = min(comp, resp);
    bool flag = false;
    rp(i, 0, 18){
        vector<int> temp = nums;
        rp(j, 0, n) temp[j] ^= (1<<i);
        comp = 0;
        rp(j, 0, n) comp += abs(temp[j]-j);
        comp /= 2;
        if(comp <= resp){
            nums = temp;
            resp = comp;
            flag = true;
        }
    }
    cout << resp + flag<< "\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    ll t = 1;
    while(t--) solvetask();
}