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 init():
	disks = int(input())
	original_pos = input()
	password = input()
	numbers = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
	total_moves = 0
	
	for i in range(0, disks):
		num1 = int(original_pos[i])
		num2 = int(password[i])
		moves1 = num1 - num2
		moves2 = numbers.index(num2) +  (len(numbers) - numbers.index(num1))
		moves3 = numbers.index(num1) +  (len(numbers) - numbers.index(num2))

		if abs(moves1) < abs(moves2) and abs(moves1) < abs(moves3):
			total_moves = total_moves + abs(moves1)
		elif abs(moves2) < abs(moves1) and abs(moves2) < abs(moves3):
			total_moves = total_moves + abs(moves2)
		elif abs(moves3) < abs(moves1) and abs(moves3) < abs(moves2):
			total_moves = total_moves + abs(moves3)
	
	print(total_moves)


if __name__ == "__main__":
	init()
