# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    n = II()
    A, B = [], []
    for __ in range(n):
        a, b = ILI()
        A.append(a)
        B.append(b)
    return n, A, B


def solve(n, A, B):
    def plus(now_ind=0, sum_a=0, sum_b=0):
        if now_ind == n:
            return abs(sum_a - sum_b)
        dif_a = plus(now_ind + 1, sum_a + A[now_ind], sum_b)
        dif_b = plus(now_ind + 1, sum_a, sum_b + B[now_ind])

        return min(dif_a, dif_b)

    ans = plus()
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()