#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

int main(void) {
  ll N;
  cin >> N;
  vector<ll> A(N), B(N);
  REP(i, 0, N) cin >> A[i] >> B[i];

  const ll INF = 1LL << 50;
  vector<vector<ll>> dp(2, vector<ll>(N * 1000 + 1, INF));
  dp[0][0] = 0;
  REP(i, 0, N) {
    REP(j, 0, N * 1000 + 1) dp[(i + 1) & 1][j] = INF;
    REP(j, 0, N * 1000 + 1) {
      dp[(i + 1) & 1][j] = min(dp[(i + 1) & 1][j], dp[i & 1][j] + B[i]);
      if(j + A[i] <= N * 1000) {
        dp[(i + 1) & 1][j + A[i]] = min(dp[(i + 1) & 1][j + A[i]], dp[i & 1][j]);
      }
    }
  }

  ll ans = INF;
  REP(j, 0, N * 1000 + 1) ans = min(ans, max(j, dp[N & 1][j]));
  cout << ans << endl;
}