#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, A, B, S = 0;
    cin >> N;
    vector<int> dp(100001, -1);
    dp[0] = 0;
    for(int i = 0; i < N; ++i){
        cin >> A >> B;
        S += B;
        for(int j = 100 * i; j >= 0; --j){
            if(dp[j] != -1) chmax(dp[j + A], dp[j] + B);
        }
    }
    int ans = INF;
    for(int i = 0; i <= 100000; ++i){
        if(dp[i] != -1)  chmin(ans, max(i, S - dp[i]));
    }
    cout << ans << endl;

    return 0;
}