algo2017_week9_Crane_Origami

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 1e9
#define fo(n) for(int i=0;i<n;i++)
#define fos(o,n) for(int i=o;i<=n;i++)

int main(){

    int n;

    while( cin >> n ){

        if( n == 0 ) break;

        int ans , w , h , now = -1;

        fo( n ){

            int l , r = 4;

            cin >> w >> h;

            l = min( w , h );

            //while( max( w , h ) / l < r && r ) l /= 2 , r /= 2;

            if( l > now ) ans = i + 1 , now = l;
        }

        cout << ans << endl;

    }

    return 0;
}