#include <bits/stdc++.h>
using namespace std;

signed main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<int> A(N), B(N);
  for (int i = 0; i < N; ++i) cin >> A[i] >> B[i];
  int asum = accumulate(A.begin(), A.end(), 0);
  int bsum = accumulate(B.begin(), B.end(), 0);

  int maxd = asum + bsum;

  vector<vector<int>> dp(2, vector<int>(2 * maxd + 1, 0x3f3f3f3f));
  dp[0][maxd + 0] = 0;
  for (int i = 0; i < N; ++i) {
    fill(dp[~i & 1].begin(), dp[~i & 1].end(), 0x3f3f3f3f);
    for (int j = -maxd; j <= maxd; ++j) {
      if (dp[i & 1][maxd + j] == 0x3f3f3f3f) continue;
      dp[~i & 1][maxd + j - A[i]] =
          min(dp[~i & 1][maxd + j - A[i]], dp[i & 1][maxd + j] + A[i]);
      dp[~i & 1][maxd + j + B[i]] =
          min(dp[~i & 1][maxd + j + B[i]], dp[i & 1][maxd + j]);
    }
  }
  
  int ans = 0x3f3f3f3f;
  for (int i = -maxd; i <= maxd; ++i) ans = min(ans, dp[N & 1][maxd + i] + max(0, i));
  cout << ans << endl;
}