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
input = sys.stdin.readline

def cin():
	return(int(input()))
def cin_():
	return(list(map(int,input().split())))

n = input()

s1 = input().strip()
s2 = input().strip()
ans = 0
for i in range(len(s1)):
	aux = int(s1[i])
	if(abs(int(s1[i]) - int(s2[i])) >= 6):
		if(int(s1[i]) < 5): 
			while(aux != int(s2[i])):
				aux -= 1
				ans += 1
				if(aux == -1):
					aux = 9
		else:
			while(aux != int(s2[i])):
				aux += 1
				ans += 1
				if(aux == 10):
					aux = 0
	else:
		ans += abs(int(s1[i]) - int(s2[i]))
				
print(ans)
