#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>
#include <cstdio>

using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

typedef pair<int,int> P;
typedef long long int LL;
typedef pair<LL,LL> LP;

const int INF = INT_MAX;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N;
	cin >> N;
	vector<int> a(N);
	vector<int> b(N);
	REP(i,N)	cin >> a[i] >> b[i];
	P ans=P(INF,INF);
	REP(i,N){
		REP(j,i){
			int x;
			P tm;
			if(b[i] - b[j] == 0){
				x = 1;
				tm = P(abs(a[i]-a[j]),x);
			}else{
				x = (a[j] - a[i])/(b[i] - b[j]);
				if(abs(a[i]-a[j]+(b[i]-b[j])*(x+1))<abs(a[i]-a[j]+(b[i]-b[j])*x))	x++;
				tm = P(abs(a[i]-a[j]+(b[i]-b[j])*x),x);
			}
			ans = min(tm, ans);
		}
	}
	cout << ans.second << endl;
	return 0;
}