#include <bits/stdc++.h>
using namespace std;

int main(){
  int n; cin >> n;
  vector<int> a(n), b(n); int asum = 0; int bsum = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
    asum += a[i]; bsum += b[i];
  }
  vector<int> dp(asum+1, -1); int tmp = 0; dp[0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = tmp; j >= 0; j--) {
      if (dp[j] >= 0) dp[j+a[i]] = max(dp[j+a[i]], dp[j]+b[i]);
    }
    tmp += a[i];
  }
  int ans = INT_MAX;
  for (int i = 0; i <= asum; i++) {
    ans = min(ans, max(i, bsum-dp[i]));
  }
  cout << ans << endl;
  return 0;
}