#include<cmath>

#include<ctime>

#include<cstdio>

#include<algorithm>

using namespace std;

const int N=;

int n,res,no[N],b[N];bool g[N][N];

inline int check(){

    res=;

    for(int i=;i<=n;i++) b[no[i]]=i;

    for(int i=;i<=n;i++){

        for(int j=;j<i;j++){

            if(g[i][j]){

                res+=abs(b[i]-b[j]);

            }

        }

    }

    return res;

}

int main(){

    srand(time()),srand(rand()+);

    scanf("%d",&n);

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

    for(int i=;i<=n;i++) no[i]=i;

    int best=check();

    for(int it=;it--;){

        for(double T=1e6;T>=1e-;T*=0.99){

            int x=rand()%n+,y=rand()%n+;

            for(;x==y;y=rand()%n+);

            swap(no[x],no[y]);

            int tmp=check();

            if(tmp<best) best=tmp;

            else if(exp((best-tmp)/T)*RAND_MAX<rand()) swap(no[x],no[y]);

        }

    }

    printf("%d\n",best);

    return ;

}