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.
from collections import deque 

def girar_derecha(num_ini, num_fin):
	numbers = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
	num_moves = 0

	while numbers[0] != num_ini:
		numbers = deque(numbers)
		numbers.rotate(1)
		numbers = list(numbers)	

	while numbers[0] != num_fin:
		numbers = deque(numbers)
		numbers.rotate(1)
		numbers = list(numbers)	
		num_moves = num_moves+1

	return num_moves


def girar_izquierda(num_ini, num_fin):
	numbers = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
	num_moves = 0

	while numbers[0] != num_ini:
		numbers = deque(numbers)
		numbers.rotate(-1)
		numbers = list(numbers)	

	while numbers[0] != num_fin:
		numbers = deque(numbers)
		numbers.rotate(-1)
		numbers = list(numbers)	
		num_moves = num_moves+1

	return num_moves


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 = girar_izquierda(num1, num2)
		moves2 = girar_derecha(num1, num2)

		if moves1 < moves2:
			total_moves = total_moves + moves1
		elif moves2 < moves1:
			total_moves = total_moves + moves2
		else:
			total_moves = total_moves + moves1
	
	print(total_moves)


if __name__ == "__main__":
	init()
