TLGCodechef

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define inf 2e18
int MOD=1000000007;//998244353;
const int nn=1000050;
bool prime[nn]; //array to store precalculated primes till 10^6
void cal_primes(){memset(prime,true,sizeof(prime)); for(int i=2;i<=sqrt(nn);++i){ if(prime[i]==true){ for(int j=i*i;j<=nn;j+=i){prime[j]=false;}}}}

void solve(int t)
{
    int testcases=t;
    while(t--)
    {
    //  cout<<"Case #"<<(testcases-t)<<": "<<endl;
        int n;cin>>n;
        int x,y;
        vector<pair<int,int>>v;
        for(int i=0;i<n;i++)
        {
            cin>>x>>y;
            v.push_back(make_pair(x,y));
        }
        int lead1=0,lead2=0,score1=0,score2=0;
        for(int i=0;i<n;i++)
        {
            score1+=v[i].first; score2+=v[i].second;
            if(score1>score2)
                lead1=max(lead1,score1-score2);
            else
                lead2=max(lead2,score2-score1);
        }
        if(lead2>lead1)
            cout<<2<<" "<<lead2;
        else
            cout<<1<<" "<<lead1;
    }
}

main()
{
    auto start=chrono::system_clock::now();
    {
        #ifndef ONLINE_JUDGE
            freopen("input.txt","r",stdin);
            freopen("output.txt","w",stdout);
            freopen("error.txt","w",stderr);
        #endif
        ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
        int t=1;
    //  cin>>t;
        solve(t);
    }
    auto end=chrono::system_clock::now();
    chrono::duration<double> elapsed=end-start;
    //cout<<endl<<"Time taken: "<<elapsed.count()<<" sec";
    return 0;
}