#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000000
#define Inf64 1000000000000000001LL
int x[3000],y[3000];
int z[6000];
int main(){
	
	int n;
	cin>>n;
	
	
	vector<int> imos(1000002);
	rep(i,n){
		int a,b;
		scanf("%d %d",&a,&b);
		int ja = 0,jb = 0;
		for(int j=1;j<=a;j++){
			x[ja] = j;
			ja++;
			j = a/j;
		}
		x[ja] = a+1;
		ja++;
		for(int j=1;j<=b;j++){
			y[jb] = j;
			jb++;
			j = b/j;
		}
		y[jb] = b+1;
		jb++;
		int jc = 0;
		int ta = 0,tb = 0;
		while(ta<ja && tb<jb){
			if(x[ta]<y[tb]){
				z[jc] = x[ta];
				ta++;
			}
			else{
				z[jc] = y[tb];
				tb++;
			}
			jc++;
		}
		while(ta<ja){
			z[jc] = x[ta];
			ta++;
			jc++;
		}
		while(tb<jb){
			z[jc] = y[tb];
			tb++;
			jc++;
		}
		jc--;
		rep(j,jc){
			if(j!=jc-1 && z[j]==z[j+1])continue;
			int d = b%z[j] - a%z[j];
			int aa = -(b/z[j]) + (a/z[j]);
			if(d>0){
				if(aa >= 0)imos[z[j]]++,imos[z[j+1]]--;
				else{
					imos[z[j]]++;
					imos[min(z[j+1],z[j] + (d-aa-1)/(-aa))]--;
				}
			}
			else{
				if(aa>0){
					imos[min(z[j+1], (1-d+aa-1)/aa+z[j])]++;
					imos[z[j+1]]--;
				}
			}
		}
		if(a<b)imos[b+1]++;
	}
	rep(i,imos.size()-1)imos[i+1] += imos[i];

	int ans = 1;
	for(int i=1;i<imos.size();i++){
		if(imos[ans]<imos[i])ans = i;
	}
	cout<<ans<<endl;
	return 0;
}