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.
n = int(input())
c = input()
a = input()
ans = 0

def dis(x,y):
    flag = 0
    q = x
    r = 0
    if x==y:
        return 0;
    else:
        while x!=y:
            r = r + 1
            if q==9:
                q=0
            else:
                q = q + 1
            if r>5:
                flag = 1
                r = 0
                q = x
                break
            if q==y:
                return r
        
        if flag == 1:
            while x!=y:
                r = r + 1
                if q==0:
                    q=9
                else:
                    q = q - 1
                if q==y:
                    return r
                    
for i,j in zip(c,a):
    i = int(i)
    j = int(j)
    ans = ans + dis(i,j)

print(ans)