#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
struct it{
  ll v,t;
  bool operator<(const it &b)const{
    if(v+t<b.v+b.t)return true;
    return false;
  }
};
int main(){
  ll n;cin >> n;
  vector<it> a(n);
  rep(i,n){
    ll v,t;cin >> v >> t;
    a[i]={v,t};
  }
  sort(all(a));
  vector<vector<bool>> dp(n+1,vector<bool>(20010));//v個持っている
  dp[0][0]=true;
  rep(i,n){
    rep(j,20010){
      if(!dp[i][j])continue;
      dp[i+1][j]=true;
      if(j+a[i].v<20010&&j<a[i].t)dp[i+1][j+a[i].v]=true;
    }
  }
  per(i,20010)if(dp[n][i])cout << i <<endl,exit(0);
}