/*
#include<stdio.h>
#include<string.h>
#include<windows.h>
#include<math.h>
int main() {
int n,a;
scanf("%d",&n);
char str[10000],sts[10000];
a = 1;
SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 7);
while(n < 150) {
for(int i = 0; i < n; i++) {
sprintf(sts, "%d", i);
a = pow(10,(strlen(sts)-1));
for(int j = 0; j < a; j++) {
sprintf(str, "%d", i*a+j);
//printf("%s",str);
for(int k = 0; k < (int)strlen(str); k++) {
if(str[k] == '3') {
SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 4);
printf("3 ");
SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 7);
break;
}
if(k == (int)strlen(str)-1) {
printf("0 ");
break;
}
}
} printf("\n");
}
n++;
printf("\n");
}
}
*/
/*
#include<stdio.h>
#include<stdlib.h>
int* array;
char* str;
int n;
void avoid(int position) {
}
int main() {
scanf("%d", &n);
array = (int*)malloc(sizeof(int)*n);
str = (char*)malloc(sizeof(char)*n);
for(int i = 0; i < n; i++) {
scanf("%d", &array[i]);
if(array[i]%2 == 0)
str[i] = 'e';
else if(array[i]%2 == 1)
str[i] = 'o';
}
for(int i = 0; i < n; i++) {
printf("%c",str[i]);
}
}
*/
/*
#include<stdio.h>
#include<stdlib.h>
int main() {
int n, num = 0,ct = 0,s=0;
int* stack;
scanf("%d",&n);
stack = (int*)malloc(sizeof(int)*n);
for(int i = 0; i < n; i++) {
scanf("%d",&stack[i]);
}
for(int i = n-1; i >= 0; i--) {
if(stack[i] > s) {
s = stack[i];
ct++;
}
}
printf("%d",ct);
}
*/
/*
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int main() {
long long int k, S, MathicValue = 0;
//1,13
//1*2*3,13*12*11
scanf("%d",&k);
for(int i = 1; i <= k; i++) {
int Mul = 1,Div = 1,Ope = 1;
for(int j = k; j >= k-i+1; j--) {
Mul *= j;
}
for(int j = 1; j <= i; j++) {
Div *= j;
}
Ope = pow(2,i-1);
MathicValue += (Mul / Div)*Ope;
printf("(%lld / %lld) * %lld = %lld\n",Mul ,Div ,Ope ,MathicValue);
}
}
*/
/*
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main() {
int n,k,e = 0;
char *stack;
scanf("%d %d\n",&n ,&k);
stack = (int*)malloc(sizeof(int) * n);
for(int i =0; i <n; i++) {
scanf("%c",&stack[i]);
}
for(int i =0; i <n; i++) {
if(stack[i] == 'P') {
for(int j =k; j >=1; j--) {
if(i-j >=0 && stack[i-j] == 'H') {
stack[i-j] = 'N';
stack[i] = 'E';
e++;
break;
}
}
if(stack[i] != 'E') {
for(int j =1; j <=k; j++) {
if(i+j < n && stack[i+j] == 'H') {
stack[i+j] = 'N';
e++;
break;
}
}
}
}
}
printf("%d",e);
}
*/
#include<stdio.h>
#include<stdlib.h>
int main() {
int n;
int **ingre;
scanf("%d",&n);
ingre = (int**)malloc(sizeof(int*) * n);
for(int i = 0; i < n; i++) {
ingre[i] = (int*)malloc(sizeof(int) * 5);
scanf("%d %d %d %d %d",&ingre[i][0] ,&ingre[i][1] ,&ingre[i][2] ,&ingre[i][3] ,&ingre[i][4]);
}
}