/*
#include <stdio.h>
int memo[41]={};
int rec(int n)
{
if(memo[n]!=0) return memo[n];
if (n==1 || n==2) return memo[n]=1;
return memo[n]=rec(n-1)+rec(n-2);
}
int main()
{
int n;
scanf("%d",&n);
printf("%d",rec(n));
}
1916
1930
3702
4564
재귀+메모이제이션
*/
/*
#include <stdio.h>
int memo[201]={};
int rec(int n)
{
if (memo[n]!=0) return memo[n];
if(n==1 || n==2) return memo[n]=1;
return memo[n]=(rec(n-1)+rec(n-2))%10009;
}
int main()
{
int n;
scanf("%d",&n);
printf("%d",rec(n));
}*/
/*
#include <stdio.h>
int memo[15][15]= {};
int rec(int k, int n)
{
if(memo[k][n]!=0)
return memo[k][n];
if(k==0)
return memo[k][n]=n;
if(n==0)
return memo[k][n]=0;
return memo[k][n]=rec(k,n-1)+rec(k-1,n);
}
int main()
{
int k,n;
while( scanf("%d %d", &k, &n) != EOF )
printf("%d\n", rec(k, n));
}
*/
/*
#include <stdio.h>
int memo[51][51]={};
int rec(int r, int c)
{
if (memo[r][c]!=0) return memo[r][c];
if (r<=1 || c<=1) return memo[r][c]=1;
return memo[r][c]=(rec(r-1,c)+rec(r,c-1))%100000000;
}
int main()
{
int r,c;
scanf("%d %d",&r,&c);
printf("%d",rec(r,c));
}
*/
/*
#include <stdio.h>
int rec()
{
}
int main()
{
int n,i;
scanf("%d",&n);
}
*/
/*
#include <stdio.h>
int rec(int n)
{
}
int main()
{
int n,i;
scanf("%d",&n);
}*/
#include <stdio.h>
int main()
{
int n,i,j;
int arr[1001][3]={};
scanf("%d",&n);
for (i=0;i<n;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&arr[i][j]);
}
}
}