#include <algorithm>
#include <stdio.h>

#define MAX 50024
#define ll long long

using namespace std;

int n;
int a[4][MAX];

inline ll calc(int vct[])
{
	ll sum = 0;
	int loc = (n + 1) / 2, ales = vct[loc] - loc;

	for (int i = 1; i <= n; i++)
		sum += (ll) abs(vct[i] - i - ales);

	return sum;
}

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[1][i], &a[2][i], &a[3][i]);

	printf("%lld\n", calc(a[1]) + calc(a[2]) + calc(a[3]));

	fclose(stdin);
	fclose(stdout);
	return 0;
}