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 math
import os
import random
import re
import sys

a = int(input())
b = str(input())
v = str(input())
l1 = []
l2 = []
for x in range(a):
    l1.append(int(b[x]))
    l2.append(int(v[x]))
c = 0
for y in range(a):
    if abs(l1[y]-l2[y])>5:
        c = c + 10 - abs(l1[y]-l2[y])
    else:
        c = c + abs(l1[y]-l2[y])
print(c)