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

import re
import collections
import math
import itertools


class Point(object):
	def __init__(self, x=0, y=0):
		self.x = x
		self.y = y



def function(*args):
    N = lambda: int(input())
    A = lambda: [int(e) for e in input()]
    P = lambda: map(int, input().split())
    disks = N()
    ori = [int(e) for e in input()]
    final = [int(e) for e in input()]
    moves = 0
    OP = lambda p, q: min([abs(p-q), 9 - abs(p-q) + 1, ((9 + abs(p-q)) % 9) + 1 ])
    for k,v in enumerate(ori):
        p = v
        q = final[k]
        res = OP(p, q)
        moves += res
    print(moves)

if __name__ == '__main__':
	function()	
