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():
	disks = int(input())
	l = [int(i) for i in input()]
	k = [int(i) for i in input()]
	ans = [abs(l[i] - k[i]) if abs(l[i] - k[i]) <= 5 \
	else int('1'+str(min(l[i],k[i]))) - max(l[i], k[i]) for i in range(disks)]
	
	print(sum(ans))
main()



#Answer is x combination - abs(y) combination
#if Answer is more than 5, max(x,y) increase by 10 and then
#the answer is x - abs(y) again.