#include <cstdio>
#include <algorithm>
#define nmax 50005
using namespace std;
int n,a[3][nmax];



int modul(int x)
{
    if (x<0)
        return -x;
    return x;
}
long long ans(int x,int v[])
{
    long long sol=0;
    for (int i=1;i<=n;i++)
        sol+=modul(x-v[i]);
    return sol;
}

long long solve(int v[])
{
    for (int i=1;i<=n;i++)
        v[i]-=i;
    if (n%2==0)
        return ans(v[n/2],v);
    return min(ans(v[n/2],v),ans(v[n/2+1],v));
}
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",&a[0][i],&a[1][i],&a[2][i]);
    printf("%lld\n",1LL*solve(a[0])+solve(a[1])+solve(a[2]));

    return 0;
}