/*
TASK:   profit
LANG:   C++
FROM:   CodeIT Round6
IDEA:   simple math
NOTES:  -
AUTHOR: Yasen Trifonov
*/
#include <cstdio>
#include <cassert>
#include <algorithm>
#define MAXN (1001)
#define MAXA (1001)
using namespace std;

int n;
int a[MAXN], b[MAXN];

int main() {
	freopen("profit.in", "r", stdin);
	freopen("profit.out", "w", stdout);
	
	scanf("%d", &n);
	assert(n > 0); 
	assert(n < MAXN);
	
	for (int i=0; i < n; ++i) { 
		scanf("%d%d", &a[i], &b[i]); 
		assert(a[i] > 0); 
		assert(a[i] < MAXA); 
		assert(b[i] > 0); 
		assert(b[i] < MAXA); 
	}
	
	int best = 0;
	
	for (int i=1; i < n; ++i) {
		if (a[best]*b[i] == b[best]*a[i]) 
			if (a[best] < a[i])
				best = i;
			
		if (a[best]*b[i] < b[best]*a[i]) 
			best = i;
	}
	
	printf("%d\n", best+1);
	return 0;
}<!-- 0.0431s -->