INF = 1 << 60
N = int(input())
tasks = []
for _ in range(N):
    A, B = map(int, input().split())
    tasks.append((A, B))

dp = [INF] * (10**5 + 10)
dp[0] = 0
# i : A が i 時間かけた
# ときの B がかけた時間の最小値
sz = len(dp)
for a, b in tasks:
    pp = [INF] * sz
    dp, pp = pp, dp
    for i in range(sz):
        if pp[i] == INF: continue
        # A が解く
        dp[i+a] = min(dp[i+a], pp[i])
        # B が解く
        dp[i] = min(dp[i], pp[i] + b)

ans = INF
for i in range(sz):
    if dp[i] == INF: continue
    ans = min(ans, max(i, dp[i]))

print(ans)