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.
import sys

def I(): return int(sys.stdin.readline().strip())
def S(): return sys.stdin.readline().strip()
  
def main():
  n = I()
  initial = S()
  target = S()
  answer = 0
  for i in range(n):
    optionA = 0
    startNumber = int(initial[i])
    while( startNumber != int(target[i]) ):
      if startNumber == 0:
        startNumber = 9
      else:
        startNumber -= 1
      optionA += 1
    
    optionB = 0
    startNumber = int(initial[i])
    while( startNumber != int(target[i]) ):
      if startNumber == 9:
        startNumber = 0
      else:
        startNumber += 1
      optionB += 1
    
    answer += min(optionA, optionB)
  print(answer)
if __name__ == "__main__":
  main()