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
i=1
for line in sys.stdin:
    if i==1:
        disk=int(line)
    elif i==2:
        start=line
    else:
        end=line
        break
    i+=1
startlist=[]
endlist=[]
for num in start:
	if num!="\n":
		startlist.append(num)
for num in end:
	if num!="\n":
		endlist.append(num)
total=0
i=0
while i<disk:
	if startlist[i]>endlist[i]:
		right=10-int(startlist[i])+int(endlist[i])
		left=int(startlist[i])-int(endlist[i])
		if right<left:
			total+=right
		else:
			total+=left
	elif startlist[i]<endlist[i]:
		right=int(endlist[i])-int(startlist[i])
		left=10-int(endlist[i])+int(startlist[i])
		if right<left:
			total+=right
		else:
			total+=left
	i+=1
print(total)
