import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
T = [tuple(map(int, input().split())) for _ in range(N)]

INF = 1 << 30
L = 102000
dp = [[INF for _ in range(L + 10)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
    a, b = T[i]
    for j in range(100000 + 1):
        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)

ans = INF
for j in range(L + 1):
    ans = min(ans, max(j, dp[N][j]))
print(ans)