#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<30;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

int main() {
  int N;
  cin >> N;
  vector<vector<int>> dp(N + 1, vector<int>(100001, INF));
  dp[0][0] = 0;
  for (int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    for (int j = 0; j < 100001; j++) {
      if (j + a < 100001) dp[i + 1][j + a] = min(dp[i + 1][j + a], dp[i][j]);
      dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + b);
    }
  }

  int mi = INF;
  for (int j = 0; j < 100001; j++) {
    if (dp[N][j] != INF) {
      mi = min(mi, max(dp[N][j], j));
    }
  }
  cout << mi << endl;

  return 0;
}