#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
const int N=15;
int s[N],b[N];
int n;
int ans=1e9;

void dfs(int u,int x,int y)//枚举到哪一个，当前的酸度，当前的苦度
{
	
	if(u==n)
	{
		int c=abs(x-y);
		ans=min(ans,c);
		return;
	}


	dfs(u+1,x*s[u],y+b[u]);

	dfs(u+1,x,y);
}


int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>s[i]>>b[i];
	}

	dfs(0,1,0);
	cout<<ans;
	return 0;
}