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

int g[15][2],sour,bit,res,n,x,y;

void dfs(int u, int s, int cnt)
{
	if (u == 0)
	{
		int ans = abs(sour-bit);
		res = min(res,ans);
	}
	
	for (int i = s; i < n; i++)
	{	
		if(u == cnt) x = sour = g[i][0],y = bit = g[i][1];
		else sour *= g[i][0],bit += g[i][1];
		dfs(u-1,i+1,cnt);
		sour = x, bit = y;
	}
}

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d",&g[i][0],&g[i][1]);
	}
	
	res = 0x3f3f3f3f;
	
	for (int i = 1; i <= n; i++)
	{
		dfs(i,0,i);
	}
	
	cout << res;
}