#include <iostream>
#include <cstdio>
#define MAXN 50050

using namespace std;

int x[MAXN], y[MAXN], z[MAXN];

int abs(int x)
{
    if (x < 0) return -x;
    return x;
}

int main()
{
    freopen("inundatii.in", "r", stdin);
    freopen("inundatii.out", "w", stdout);

    int n, a, b, c;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d %d %d", &x[i], &y[i], &z[i]);
    long long rez = 0;
    int mx = x[(n+1)>>1];
    int my = y[(n+1)>>1];
    int mz = z[(n+1)>>1];
    for (int i = 1; i <= n; i++)
    {
        rez += abs(x[i] - (mx - ((n+1)>>1) + i));
        rez += abs(y[i] - (my - ((n+1)>>1) + i));
        rez += abs(z[i] - (mz - ((n+1)>>1) + i));
    }
    printf("%lld", rez);



    return 0;
}