// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

bool dp[10001][20001];

bool comp(const P &x, const P &y){
  return x.FI + x.SE < y.FI + y.SE;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<P> p(n);
  rep(i, n)cin >> p[i].SE >> p[i].FI;
  sort(all(p), comp);
  dp[0][0] = true;
  for(int i = 0; i < n; i++){
    for(int j = 0; j <= 20000; j++){
      int v = p[i].SE;
      int t = p[i].FI;
      dp[i+1][j] = dp[i][j];
      if(j-v>=0 && j-v<t)dp[i+1][j] |= dp[i][j-v];
    }
  }
  for(int i = 20000; i >= 0; i--){
    if(dp[n][i]){
      cout << i << endl;
      return 0;
    }
  }
	return 0;
}