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())
original = list(map(int, input()))
keys = list(map(int, input()))

moves = 0
for i in range(n):
    key = keys[i]
        
    forwards = 0
    backwards = 0
    
    oriFor = original[i]
    oriBack = original[i]
    oriForStop = False
    oriBackStop = False
    
    while True:
        if oriFor != key:
            if oriFor == 9:
                oriFor = 0
                forwards += 1
                
            oriFor += 1
            forwards += 1
        else:
            oriForStop = True
        
        if oriBack != key:
            if oriBack == 0:
                oriBack = 9
                backwards += 1
                
            oriBack -= 1
            backwards += 1
        else:
            oriBackStop = True
        
        if oriForStop and oriBackStop:
            break

    moves += forwards if forwards < backwards else backwards

print(moves)