Class President

 

#include<bits/stdc++.h>
#define N 1000

using namespace std;

int n;
struct T{
    int sum,idx,n3,n2;
}A[N+5];

bool sf(T a,T b){
    if(a.sum==b.sum){
        if(a.n3==b.n3){
            return a.n2>b.n2;
        }
        return a.n3>b.n3;
    }
    return a.sum>b.sum;
}

void input(){
    cin>>n;
    int t1,t2,t3;
    for(int i=1;i<=3;i++){
        A[i].idx=i;
    }
    for(int i=0;i<n;i++){
        cin>>t1>>t2>>t3;
        A[1].sum+=t1;
        A[2].sum+=t2;
        A[3].sum+=t3;
        if(t1==3) A[1].n3++;
        if(t2==3) A[2].n3++;
        if(t3==3) A[3].n3++;
        if(t1==2) A[1].n2++;
        if(t2==2) A[2].n2++;
        if(t3==2) A[3].n2++;
    }
    sort(A+1,A+n+1,sf);
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //freopen("in.txt","r",stdin);
    input();
    if(A[1].sum==A[2].sum&&A[1].n3==A[2].n3&&A[1].n2==A[2].n2){
        cout<<"0 "<<A[1].sum<<endl;
        return 0;
    }
    cout<<A[1].idx<<" "<<A[1].sum<<endl;
    return 0;
}