void main(){
  import std.stdio, std.string, std.conv, std.algorithm;
  import std.math, std.range;

  int n; rd(n);
  auto a=new long[](n), b=new long[](n);
  foreach(i; 0..n) rd(a[i], b[i]);

  auto data=new long[](0);
  foreach(bit; 0..(1<<(n/2))){
    long sa=0, sb=0;
    foreach(i; 0..(n/2)){
      if(bit&(1<<i)) sa+=a[i];
      else sb+=b[i];
    }
    data~=(sa-sb);
  }
  sort(data);
  auto p=assumeSorted(data);
  auto m=n-n/2;
  long mn=1_000_000_000_000_000_000;
  foreach(bit; 0..(1<<m)){
    long sa=0, sb=0;
    foreach(i; 0..m){
      if(bit&(1<<i)) sa+=a[i+n/2];
      else sb+=b[i+n/2];
    }
    auto d=sa-sb;
    auto lb=p.lowerBound(-d),
         ub=p.upperBound(-d);
    if(lb.length+ub.length<p.length) mn=0;
    if(lb.length>0) mn=min(mn, (d+lb.back).abs);
    if(ub.length>0) mn=min(mn, (d+ub.front).abs);
  }

  writeln(mn);
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}