#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
typedef long long lld;
struct Fraction
{
    lld chisl,znam,ind;
};
Fraction fract[1002];
bool sh (Fraction a,Fraction b)
{
    return (a.chisl*b.znam)>(b.chisl*a.znam);
}
int main ()
{
    freopen("profit.in","r",stdin);
    freopen ("profit.out","w",stdout);
    lld i,j;
    lld n;
    scanf("%lld",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%lld %lld",&fract[i].chisl,&fract[i].znam);

        fract[i].ind=i;
    }
    sort (fract+1,fract+n+1,sh);
    printf("%lld\n",fract[1].ind);
}
<!-- 0.0399s -->