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.




n = int(input())

lock= input()
combo = input()

moves = 0
#for each disk
for i in range(n):

#compare first value of each

#a better way
	locki = int(lock[i])
	comboi = int(combo[i])

	between = abs(locki - comboi)
	minmoves = min(between, 10 - between)
	moves += minmoves

print(moves)

"""	
	locki = int(lock[i])
	comboi = int(combo[i])
	#first see if the lock value is closer to 0 or 10
	lockmin = min(abs(locki - 0), abs(locki - 10))
	#then check the combo value
	combomin = min(abs(comboi - 0), abs(comboi - 10))
	#then check if the sums of those moves 
	#are smaller than moving towards eachother without passing 0
	minmoves = min(lockmin + combomin, abs(locki - comboi))
	#add the moves for each disk
	moves += minmoves
print(moves)
	"""


