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

using namespace std;

int n;
unsigned long long a[1001],b[1001];


unsigned long long f(unsigned long long x)
{
	unsigned long long _max=a[0]+b[0]*x,_min=a[0]+b[0]*x;

	for(int i=1;i<n;i++){
		_max=max(_max,a[i]+b[i]*x);
		_min=min(_min,a[i]+b[i]*x);
	}

	return _max-_min;
}

//下に凸
unsigned long long f2(unsigned long long x)
{
	return f(x)*f(x);
}

// left-ml-mr-right
unsigned long long search(unsigned long long left, unsigned long long right)
{
	for (long long i = 0; i < 10000; i++){
		unsigned long long ml=(right-left)/3,mr=2*(right-left)/3;
		unsigned long long fl=f2(ml),fr=f2(mr);
		if(fl>fr) left=ml;
		else right=mr;
	}
	return (right + left)/2;
}

int main()
{
	cin>>n;

	set<pair<unsigned long long,unsigned long long> > s;
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i];
		s.insert(make_pair(a[i],b[i]));
	}

	if(s.size()==1){cout<<1<<endl; return 0;}

	unsigned long long left=1,right=1e6;
	unsigned long long mid=search(left,right);
//	cout<<mid<<endl;

	vector<pair<unsigned long long,unsigned long long> > vp;
	vp.push_back(make_pair(f(mid-2),mid-2));
	vp.push_back(make_pair(f(mid-1),mid-1));
	vp.push_back(make_pair(f(mid),mid));
	vp.push_back(make_pair(f(mid+1),mid+1));
	vp.push_back(make_pair(f(mid+2),mid+2));

	sort(vp.begin(),vp.end());
	for(int i=0;i<5;i++){
		if(vp[i].second>0){ cout<<vp[i].second<<endl; break;}
	}

	return 0;
}