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 main(ar1, ar2):
  res = 0
  for i in range(len(ar1)):
    a = ar1[i]
    b = ar2[i]
    if a > b:
      k1 = a-b
      k2 = 10 + b - a
    elif b > a:
      k1 = b-a
      k2 = 10 + a - b
    if k1 <= k2:
      res += k1
    else:
      res += k2
      
  return res

n = input()
arr1 = [int(i) for i in list(input())]
arr2 = [int(i) for i in list(input())]
print(main(arr1, arr2))