#include<cstdio>
#include<algorithm>
using namespace std;
int n;
int x[50002],y[50002],z[50002];

int cmp(int a, int b)
{
	if(a>b)
		return 1;
	return 0;
}

void read()
{
	freopen("inundatii.in","r",stdin);
	freopen("inundatii.out","w",stdout);
	scanf("%d",&n);
	int i;
	for(i=1;i<=n;i++)
		scanf("%d%d%d",&x[i],&y[i],&z[i]);
	sort(x+1,x+n+1,cmp);
	sort(y+1,y+n+1,cmp);
	sort(z+1,z+n+1,cmp);
	int s=0,m1,m2,m3;
	m1=x[(n+1)/2]-(n+1)/2;
	m2=y[(n+1)/2]-(n+1)/2;
	m3=z[(n+1)/2]-(n+1)/2;
	for(i=1;i<=n;i++)
		s=s+abs(x[i]-(m1+i))+abs(y[i]-(m2+i))+abs(z[i]-(m3+i));
	printf("%d\n",s);
}

int main()
{
	read();
	return 0;
}