#include <bits/stdc++.h>
using namespace std;
int n,s[15],b[15],book[15],ans=1919810;
void dfs(int t,int sum,int pro) //sum是苦度总和，pro是酸度总积
{
	if(t==n+1)
	{
		ans=min(abs(sum-pro),ans);
		return;
	}
	for(int i=1;i<=n;i++)
	{
		if(book[i]==0)
		{
			book[i]=1;
			dfs(t+1,sum+=s[i],pro*=b[i]);
			dfs(t+1,sum,pro);
			book[i]=0;
		}
	}
}
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>s[i]>>b[i];
	dfs(1,0,1);
	cout<<ans;
	return 0;
}