Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.

The combination lock is represented by *n* rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?
The first line contains a single integer *n* (1 ≤ *n* ≤ 1000) — the number of disks on the combination lock.

The second line contains a string of *n* digits — the original state of the disks.

The third line contains a string of *n* digits — Scrooge McDuck's combination that opens the lock.
def checksum(xi,xf):
  if xf==xi:
    return 0
  elif xf>xi:
    s1=xf-xi
    s2=10-(xf-xi)
    if s1>s2:
      return s2
    else:
      return s1
  else:
    s1=xi-xf
    s2=10-(xi-xf)
    if s1>s2:
      return s2
    else:
      return s1
def check(n,s1,s2):
  list1=[]
  list2=[]
  v=0
  for r1 in s1:
    list1.append(int(r1))
  for r2 in s2:
    list2.append(int(r2))
  for y in range(n):
    a=checksum(list1[y],list2[y])
    v+=a
  return v
n=int(input())
s1=list(input())
s1=list(input())
print(check(n,s1,s2))