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 fu(sone, stwo):
    moves =0
    for i in range(len(sone)):
     
        moves +=min(abs(int(sone[i])-int(stwo[i])), otherway(sone[i], stwo[i]))
    return moves
def otherway(f, s):
    v =0
    f =int(f)
    s =int(s)
    if f>s:
        while f!=s:
            f +=1
            if f==10:
                f =0
            v +=1
    else:
        while s!=f:
            s +=1
            if s==10:
                s =0
            v +=1
    return v


def main():
    a =int(input())
    st =input()
    st1 =input()
    print(fu(st, st1))


main()