#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;

ifstream f("inundatii.in"); ofstream g("inundatii.out");

int a[50005], b[50005], c[50005];
int i, j, n, da, db, dc, d, ma, mb, mc;

int main(){
	f>>n;
	for (i=1; i<=n; i++) f>>a[i]>>b[i]>>c[i];
	
	sort (a+1, a+n+1);
	sort (b+1, b+n+1);
	sort (c+1, c+n+1);
	
	ma=a[n/2+1]; mb=b[n/2+1]; mc=c[n/2+1];
	for (i=1; i<=n; i++){
		da+=abs(a[i]-ma);
		db+=abs(b[i]-mb);
		dc+=abs(c[i]-mc);
	}
		
	if (n%2==1){
		da+=(n/2)*(n/2+1);
		db+=(n/2)*(n/2+1);
		dc+=(n/2)*(n/2+1);
	}
	else {
		da+=(n/2)*(n/2);
		db+=(n/2)*(n/2);
		dc+=(n/2)*(n/2);
	}
	
	d=da+db+dc;
	
	g<<d;
}