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.
# BOOGEYMAN >>> Version 13.0
def BoogeyMan() -> None:
    '''
    Query
    '''

    # listname, toBreakWhile, startingIndex, forward/reverse
    def cycle(list_name : list, breakpoint, startIndex : int = 0, direction : int = 1) -> (int, list) :
        temp,tempStore = 0,[]
        for idx,i in enumerate(itertools.cycle(list_name[::direction])):
            if idx >= startIndex:
                if i!=breakpoint: temp+=1; tempStore.append(i)
                else: break
        return temp, tempStore

    l = [i for i in range(10)]

    length = ii()
    s1 = si()
    s2 = si()
    c = 0
    for i,j in zip(s1,s2):
        ans1 = cycle(l,int(j), int(i))
        ans2 = cycle(l,int(i), int(j))
        m = min(ans1[0],ans2[0])
        c+=m
    p(c)
            
if __name__ == "__main__":
    import os, sys, math, itertools, bisect
    from collections import deque, defaultdict, OrderedDict, Counter
    # from functools import cache, lru_cache # @lru_cache(maxsize=100)
    ii,si = lambda : int(input()), lambda : input()               
    mi, msi  = lambda : map(int,input().strip().split(" ")), lambda : map(str,input().strip().split(" ")) 
    li, lsi = lambda : list(mi()), lambda : list(msi())
    out, export, p, pp = [], lambda : print('\n'.join(map(str, out))), lambda x : out.append(x), lambda array : p(' '.join(map(str,array)))
    try:
        from baba_yaga import L, cmdIO, _generator_
        class _BoogeyMan_:
            def __init__(self) -> None: self.launchers = [cmdIO(), BoogeyMan(), export(), _generator_()]
            def init(self) -> None:
                for _ in self.launchers: yield _ ; assert not _ , "EOF" 
            def container(fun) :
                def wrapper(): print(f"Success",end="\n"); fun()
                return wrapper
        @_BoogeyMan_.container
        def assembler() : _BoogeyMan_().init()
        assembler()
    except (FileNotFoundError,ModuleNotFoundError): input = sys.stdin.readline; BoogeyMan(); export()