import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N;
long[] A, B;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[N];
      B = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
        B[i] = readLong();
      }
      
      long[] xs, ys;
      foreach (p; 0 .. 1 << N / 2) {
        long sum;
        foreach (i; 0 .. N / 2) {
          sum += ((p >> i) & 1) ? +A[i] : -B[i];
        }
        xs ~= sum;
      }
      foreach (p; 0 .. 1 << (N - N / 2)) {
        long sum;
        foreach (i; N / 2 .. N) {
          sum += ((p >> (i - N / 2)) & 1) ? +A[i] : -B[i];
        }
        ys ~= sum;
      }
      xs.sort;
      ys.sort;
      
      long ans = INF;
      foreach (x; xs) {
        const pos = ys.lowerBound(-x);
        if (pos < ys.length) {
          chmin(ans, abs(x + ys[pos]));
        }
        if (pos - 1 >= 0) {
          chmin(ans, abs(x + ys[pos - 1]));
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}