#include <bits/stdc++.h>

using namespace std;

ifstream fin("inundatii.in");
ofstream fout("inundatii.out");

typedef long long int ll;

const int NMax = 5e4 + 5;
const ll INF = 1e15;

ll D[NMax][3];

inline ll MOD(ll x) {
    return max(x, -x);
}

int main() {
    ios::sync_with_stdio(false);

    int n;
    fin >> n;

    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < 3; j++) {
            fin >> D[i][j];
            D[i][j] -= i;
        }
    }

    ll pr = 0;
    for(int i = 0; i < 3; i++) {
        ll mid = (D[1][i] + D[n][i]) / 2;

        ll best = INF;
        for(int k = -2; k <= 2; k++) {
            ll ans = 0;
            ll x = mid + k;

            for(int j = 1; j <= n; j++) {
                ans = ans + MOD(x - D[j][i]);
            }
            best = min(ans, best);
        }

        pr += best;
    }

    fout << pr;
    return 0;
}