#include <stdio.h>
#include <algorithm>
#define maxn 50100

using namespace std;

int x[maxn], y[maxn], z[maxn];
int n, i, j;
long long rez;

long long my_abs(long long x) {
	if (x >= 0)
		return x;
	return -x;
}

long long solve(int v[]) {
	int i, med;
	long long sol = 0;
	for (i = 1; i <= n; i++)
		v[i] -= i;
	sort(v + 1, v + n + 1);

//	printf("%d\n", v[n / 2 + 1]);

	med = v[n / 2 + 1];
	for (i = 1; i <= n; i++)
		sol += my_abs(v[i] - med);
	
	return sol;

}

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

	scanf("%d", &n);
	for (i = 1; i <= n; i++) 
		scanf("%d%d%d", &x[i], &y[i], &z[i]);

	rez = solve(x);
	rez += solve(y);
	rez += solve(z);

	printf("%lld\n", rez);
	

	return 0;
}