#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
int x[4] = { 0 };
int c[4][2] = { 0 };
for (int i=1; i<=n; i++){
for(int j=1; j<=3; j++){
int a;
scanf("%d", &a);
x[j] += a;
if (a == 2)c[j][0]++;
else if (a == 3)c[j][1]++;
}
}
int maxV = max({x[1], x[2], x[3]});
int p = -1, q = -1;
for (int i=1; i<=3; i++){
if (maxV == x[i]){
if(p == -1)p = i;
else{
if(c[p][1] < c[i][1])p = i, q = -1;
else if(c[p][1] == c[i][1]){
if(c[p][0] < c[i][0])p = i, q = -1;
else if(c[p][0] == c[i][0]){
q = 0;
}
}
}
}
}
if(q == 0)p = 0;
printf("%d %d\n", p, maxV);
}
I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpewoKCWludCBuOwoJc2NhbmYoIiVkIiwgJm4pOwoKCWludCB4WzRdID0geyAwIH07CglpbnQgY1s0XVsyXSA9IHsgMCB9OwoKCWZvciAoaW50IGk9MTsgaTw9bjsgaSsrKXsKCQlmb3IoaW50IGo9MTsgajw9MzsgaisrKXsKCQkJaW50IGE7CgkJCXNjYW5mKCIlZCIsICZhKTsKCQkJeFtqXSArPSBhOwoJCQlpZiAoYSA9PSAyKWNbal1bMF0rKzsKCQkJZWxzZSBpZiAoYSA9PSAzKWNbal1bMV0rKzsKCQl9Cgl9CgoJaW50IG1heFYgPSBtYXgoe3hbMV0sIHhbMl0sIHhbM119KTsKCWludCBwID0gLTEsIHEgPSAtMTsKCglmb3IgKGludCBpPTE7IGk8PTM7IGkrKyl7CgkJaWYgKG1heFYgPT0geFtpXSl7CgkJCWlmKHAgPT0gLTEpcCA9IGk7CgkJCWVsc2V7CgkJCQlpZihjW3BdWzFdIDwgY1tpXVsxXSlwID0gaSwgcSA9IC0xOwoJCQkJZWxzZSBpZihjW3BdWzFdID09IGNbaV1bMV0pewoJCQkJCWlmKGNbcF1bMF0gPCBjW2ldWzBdKXAgPSBpLCBxID0gLTE7CgkJCQkJZWxzZSBpZihjW3BdWzBdID09IGNbaV1bMF0pewoJCQkJCQlxID0gMDsKCQkJCQl9CgkJCQl9CgkJCX0KCQl9Cgl9CgoJaWYocSA9PSAwKXAgPSAwOwoJcHJpbnRmKCIlZCAlZFxuIiwgcCwgbWF4Vik7Cgp9