#include <cstdio>
#include <algorithm>
#include <cstring>
#define ll long long
#define maxN 50002
using namespace std;
int n, i, j;
struct building
{
    int x;
    int y;
    int z;
}v[maxN];
int sx, sy, sz;
ll sol;
void read()
{
    freopen("inundatii.in", "r", stdin);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d %d %d", &v[i].x, &v[i].y, &v[i].z);
}
void solve()
{
    int i;
    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);
    }
}
void write()
{
    freopen("inundatii.out", "w", stdout);
    printf("%lld\n", sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}