#include <cstdio>
#include<algorithm>
#include<algorithm>
#define ll long long
using namespace std;
int n,i;
ll sx,sy,sz,sol;
struct rec {ll x,y,z;}v[50001];
int cmp(ll a,ll b)
{
    if(a<b)return 0;
    else return 1;
}
int main()
{
    freopen("inundatii.in","r",stdin);
    freopen("inundatii.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%lld%lld%lld",&v[i].x,&v[i].y,&v[i].z);
    sx=v[n/2+1].x;
    sy=v[n/2+1].y;
    sz=v[n/2+1].z;
    for(i=1;i<=n;i++)
    {
        sol+=abs((sx-n/2-1+i)-v[i].x);
        sol+=abs((sy-n/2-1+i)-v[i].y);
        sol+=abs((sz-n/2-1+i)-v[i].z);
    }
    printf("%lld\n",sol);
    return 0;
}