/**
	author:  shobonvip
	created: 2026.02.03 12:15:17
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<ll> a(n), b(n);
	rep(i,0,n) {
		cin >> a[i] >> b[i];
	}

	const int mx = 1e6 + 30;
	vector<ll> c(2*mx+1);
	rep(i,0,n) {
		c[a[i]+mx+1]++;
		c[b[i]+mx+1]--;
		c[a[i]-b[i]+mx+1]--;
	}
	rep(i,0,2*mx) c[i+1] += c[i];

	ll ans = -1;
	ll ansind = -1;
	for (int i=1;i<mx;i++){
		ll tmp = 0;
		for (int j=-mx/i-1;j<=mx/i+1;j++) {
			int l = min(2*mx,max(0,j*i+mx));
			int r = min(2*mx,max(0,(j+1)*i+mx));
			tmp += (c[r]-c[l])*j;
		}
		if (chmax(ans, tmp)) {
			ansind = i;
		}
	}

	cout << ansind << endl;
}