#include <cstdio>

using namespace std;

#define maxn 50010

int v[maxn][4];
int n;

long long ab(long long a)
{
    if(a<0)
        return -a;
    return a;
}

long long solve(int poz)
{
    long long mij=v[n/2+1][poz]-n/2-1, sol=0;

    for(int i=1; i<=n; ++i)
        sol+=ab(v[i][poz]-i-mij);

    return sol;
}

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

    scanf("%d", &n);
    for(int i=1; i<=n; ++i)
        scanf("%d%d%d", &v[i][1], &v[i][2], &v[i][3]);

    printf("%lld\n", solve(1)+solve(2)+solve(3));

    return 0;
}