import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum LIM = 10^^5 + 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      auto B = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
        B[i] = readInt();
      }
      auto dp = new int[][](N + 1, LIM);
      foreach (i; 0 .. N + 1) {
        dp[i][] = LIM;
      }
      dp[0][0] = 0;
      foreach (i; 0 .. N) {
        foreach (x; 0 .. LIM) {
          if (x + A[i] < LIM) {
            chmin(dp[i + 1][x + A[i]], dp[i][x]);
          }
          {
            chmin(dp[i + 1][x], dp[i][x] + B[i]);
          }
        }
      }
      int ans = LIM;
      foreach (x; 0 .. LIM) {
        chmin(ans, max(x, dp[N][x]));
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}