#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<pair<int, int> > p(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> p[i].first >> p[i].second;
    }
    sort(p.begin() + 1, p.end(), [&](pair<int, int> a, pair<int, int> b){
        return a.first - a.second < b.first - b.second;
    });
    int ans = 1e9;
    for(int i = 0; i <= n; i++){
        int t1 = 0, t2 = 0;
        for(int j = 1; j <= i; j++){
            t1 += p[j].first;
        }
        for(int j = i + 1; j <= n; j++){
            t2 += p[j].second;
        }
        ans = min(ans, max(t1, t2));
    }
    cout << ans << '\n';

}