#include<bits/stdc++.h>
using namespace std;
long long m=1e4+5,le,ri,minn=INT32_MAX;
long long n,cs,k,c,a1[15],b1[15],num,b,r,a2[5][25];
void dfs(long long sd,long long kd,int bj)
{
	if(fabs(sd-kd)<minn&&cs==1){
		minn=fabs(sd-kd);
	}
	if(bj>n){
	}
	else{
		for(int i=bj;i<=n;i++){
			cs=1;
			sd*=a1[i];
			kd+=b1[i];
			dfs(sd,kd,bj+1);
			sd/=a1[i];
			kd-=b1[i];
		}
	}
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a1[i]>>b1[i];
	}
	dfs(1,0,1);
	cout<<minn;
	return 0;
}