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.
d = int(input("How many digits: ") )

first = str(input("current number :  "))
last = str(input("passcode number :  "))

t1=0
t2=0
tf=0

initial = []

final = []

for i in range(0, d):
    initial.append(int(first[i]))

for j in range(0, d):
    final.append(int(last[i]))

between=[]

for k in range(0, d):
    c = initial[k]
    f = final[k]
    t1 = abs(c-f)

    if c > f :
           t2 = abs((10+f) - c)
    elif f > c :
           t2 = abs((10+c) - f)
    elif f == c:
           t2 = 0

    if t1 > t2:
          tf = t2
    elif t2 > t1:
          tf = t1

    between.append(tf)


ans = sum(between)
print(ans)
