#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,ans;
int dp[10010][10010];
P a[10010];

void solve(){
  cin >> n;
  rep(i,n){
    cin >> a[i].first >> a[i].second;
  }
  sort(a,a+n,[](const P& a,P& b){return (a.first+a.second)<(b.first+b.second);});
  dp[0][0]=1;
  rep(i,n){
    //cout << a[i].first << " " << a[i].second << endl;
    rep(j,10001){
      if (!dp[i][j]) continue;
      dp[i+1][j]=1;
      if(a[i].second<=j) continue;;
      ans=max(ans,j+a[i].first);
      if (j+a[i].first<=10000)  dp[i+1][j+a[i].first]=1;
    }
  }
  cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}