#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<set>
using namespace std;
typedef pair<int,int> PII;
const int N=333;
int n;
struct TL{
    int s,b;
}tl[N];
bool h[N];
int ans=0x3f3f3f3f;

int bfs()
{
    queue<PII> q;
    q.push({1,0});

    while(q.size())
    {
        auto t=q.front();
        q.pop();
        for(int i=0;i<n;i++)
        {
            if(!h[i])
            {
                h[i]=true;
                int sd=t.first*tl[i].s;
                cout<<sd<<"ppp"<<endl;
                int kd=t.second+tl[i].b;
                cout<<kd<<"ppp"<<endl;
                q.push({sd,kd});
                ans=min(ans,abs(sd-kd));
                
            }     
        }
    }
    return ans;
}
int main()
{
    cin>>n;
    set<int> p;
    for(int i=0;i<n;i++)
    {
        cin>>tl[i].s>>tl[i].b;
        p.insert(abs(tl[i].s-tl[i].b));
    }
    cout<<bfs()<<endl;
    system("pause");
    return 0;
}