#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 20005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1}; //<^>v

P p[MX];

int dp[MX];

int main(){
  int n;
  scanf("%d",&n);
  rep(i,n) scanf("%d%d",&p[i].se,&p[i].fi);
  sort(p,p+n);
  reverse(p,p+n);
  dp[0] = 1;
  for (int i = 0; i <= 10000 && n; ++i) {
    if (!dp[i]) continue;
    while (n && p[n-1].fi <= i) --n;
    rep(j,n) dp[i+p[j].se] = 1;
  }

  int ans = 0;
  rep(i,MX) if(dp[i]) ans = max(ans,i);

  cout << ans << endl;
  
  return 0;
}