#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
bool compare(const pii& f , const pii& s){
  return f.fi * s.se < f.se * s.fi;
}
int main(){
  freopen("profit.in" , "r" , stdin);
  freopen("profit.out" , "w" , stdout);
  int N;
  scanf("%d" , &N);
  vector<pii> in(N);
  for(int i=0;i<N;++i)
   scanf("%d%d" , &in[i].fi , &in[i].se);
  int bst = 0;
  for(int i=1;i<N;++i)
   if(compare(in[bst] , in[i]))
    bst = i;
  printf("%d\n" , bst + 1);
  return 0;
}