n=int(input())
dp=[1<<30]*(1000*n+1);dp[0]=0
for i in range(n):
    a,b=map(int,input().split())
    dp2=[1<<30]*len(dp)
    for j in range(len(dp2)):
        if j+a<len(dp):
            dp2[j+a]=min(dp2[j+a],dp[j])
        dp2[j]=min(dp2[j],dp[j]+b)
    dp=dp2
ans=1<<30
for i in range(len(dp)):
    ans=min(ans,max(i,dp[i]))
print(ans)