#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long Int;

struct buyer
{
    Int a,b,orgind;
};

buyer buyers[1001];

bool SortEm(buyer A,buyer B)
{
    buyer ca=A,cb=B;

    ca.a=ca.a*cb.b;
    cb.a=cb.a*ca.b;

    return (ca.a>=cb.a);
}

int main()
{
    freopen("profit.in","r",stdin);
    freopen("profit.out","w",stdout);

    Int n;
    Int i;

    scanf("%I64d",&n);

    for (i=1;i<=n;i++)
    {
        scanf("%I64d %I64d",&buyers[i].a,&buyers[i].b);

        buyers[i].orgind=i;
    }

    sort(buyers+1,buyers+1+n,SortEm);

    printf("%I64d\n",buyers[1].orgind);

    return 0;
}