#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /*Coding Space*/ // O(10^7)は定数 int dp[101][100001]; int main(){ int n; cin >> n; fill_n(dp[0],101*100001,-1); dp[0][0] = 0; rep(i,n){ int a,b; cin >> a >> b; rep(j,100001){ if(dp[i][j] != -1){ dp[i+1][j] = (dp[i+1][j] == -1?dp[i][j]+b:min(dp[i+1][j],dp[i][j]+b)); dp[i+1][j+a] = (dp[i+1][j+a] == -1?dp[i][j]:min(dp[i+1][j+a],dp[i][j])); } } } int ans = INF; rep(j,100001) if(dp[n][j] != -1) ans = min(ans, max(dp[n][j],j)); cout << ans << endl; }