#include<bits/stdc++.h>
using namespace std;
int s[11],b[11],n,mina = 1e9,ans,bns = 1;
inline void dfs(int k){
	if (k > n) return;
	ans += s[k];
	bns *= b[k];
	mina = min(abs(ans-bns),mina);
	dfs(k + 1);
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> n;
	for (int i = 1;i <= n;i++)
		cin >> s[i] >> b[i];
	for (int i = 1;i <= n;i++){
		ans = 0,bns = 1;
		dfs(i);
	}
	cout << mina;
	return 0;
}

请给出理由