import java.util.Scanner;

public class N545
{

	public static void main(String[] args)
	{
		int min=100000;
		int abs=0;
		int total=0;
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int[] a=new int[n];
		int[] b=new int[n];
		for(int i=0;i<n;i++)//1-n
		{
			a[i]=sc.nextInt();
			b[i]=sc.nextInt();
		
		}
		int l=0;
		
while(l<Math.pow(2,n))
{
		int k=1;
		int atotal=0;
		int btotal=0;
		int count=0;

		while(k<Math.pow(2,n))
		{
			if((k&l)!=0)
			{
				atotal+=a[count];
			}
			else
			{
				btotal+=b[count];
			}
			k=k*2;
			count++;
		}
		k=1;
		abs=Math.abs(atotal-btotal);
		min=(abs<min)?abs:min;
	l++;
}
System.out.println(min);
	}

}