#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<ctime>

#include<queue>

#include<vector>

#include<set>

#include<map>

#include<stack>

#include<bitset>

using namespace std;

bitset<>a[][],ans;

int d[][];

int main(){

      int n,m,i,j,k;

      scanf("%d",&n);

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

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

          int x;

          scanf("%d",&x);

          d[x][j]=i;

        }

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

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

          a[d[i][j]][j]=a[d[i-][j]][j];

          a[d[i][j]][j][d[i-][j]]=;

        }

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

          ans=a[i][]&a[i][]&a[i][]&a[i][]&a[i][];

          printf("%d\n",ans.count());

      }

      return ;

}