package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	aa := make([]int64, n)
	bb := make([]int64, n)
	for i := 0; i < n; i++ {
		aa[i] = getNextInt64(scanner)
		bb[i] = getNextInt64(scanner)
	}
	var a, b int64
	ma := map[int64]bool{}
	mb := map[int64]bool{}
	sa := make([]int64, 0)
	sb := make([]int64, 0)
	var c cint
	c = math.MaxInt64
	for i := 0; i < 1<<uint(n/2); i++ {
		a = 0
		b = 0
		for j := 0; j < n/2; j++ {
			if i>>uint(j)&1 == 1 {
				a += aa[j]
				continue
			}
			b += bb[j]
		}
		ma[a-b] = true
	}
	for m := range ma {
		sa = append(sa, m)
	}
	for i := 0; i < 1<<uint(n-n/2); i++ {
		a = 0
		b = 0
		for j := 0; j < n-n/2; j++ {
			if i>>uint(j)&1 == 1 {
				a += aa[n/2+j]
				continue
			}
			b += bb[n/2+j]
		}
		mb[a-b] = true
	}
	for m := range mb {
		sb = append(sb, m)
	}
	sort.SliceStable(sa, func(i, j int) bool {
		return sa[i] < sa[j]
	})
	sort.SliceStable(sb, func(i, j int) bool {
		return sb[i] < sb[j]
	})
	for i := 0; i < len(sa); i++ {
		l := -1
		r := len(sb)
		for l+1 < r {
			m := (l + r) >> 1
			if sa[i]+sb[m] < 0 {
				l = m
				continue
			}
			r = m
		}
		if l >= 0 {
			c.minAs(absint(sa[i] + sb[l]))
		}
		if r < len(sb) {
			c.minAs(absint(sa[i] + sb[r]))
		}
	}
	fmt.Fprintln(writer, c)
}

func absint(a int64) cint {
	if a < 0 {
		return cint(-a)
	}
	return cint(a)
}

type cint int64

func (ct *cint) minAs(x cint) *cint {
	*ct = ct.min(x)
	return ct
}
func (ct *cint) maxAs(x cint) *cint {
	*ct = ct.max(x)
	return ct
}
func (ct cint) min(x cint) cint {
	if ct > x {
		return x
	}
	return ct
}
func (ct cint) max(x cint) cint {
	if ct < x {
		return x
	}
	return ct
}