import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


proc popCount(v:int):int=
  var
    x = v
  while x>0:
    result+=(x and 1)
    x = x shr 1

proc solve():int=
  var
    n = scan()
    ab = newseqwith(n,(scan(),scan()))
    dp = newseqwith(2^n,newseqwith(n,int.high.div(4)))


  for s in 1..<2^n:
    if s.popCount==1:
      for i in 0..<n:
        if (s and (1 shl i)) > 0:
          dp[s][i]=0

    else:
      # iを追加したとき、jが最後に追加されていたときの最善値
      for i in 0..<n:
        for j in 0..<n:
          if (s and (1 shl i)) > 0 and (s and (1 shl j)) > 0 and i!=j:
            dp[s][i].min=max(dp[s-(1 shl i)][j],ab[j][1]-ab[j][0]+ab[i][0])
  return dp[2^n-1].min()

  
  
echo solve()