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.
disks = int(input('enter num of disks'))
state = input('enter the current state')
passw = input('enter the pass')
moves = 0
while disks>0:
    x = (10-int(passw[disks-1]))+int(state[disks-1])
    f = (10-int(state[disks-1]))+int(passw[disks-1]) 
    y = abs(int(passw[disks-1])-int(state[disks-1]))
    if x<y or f<y:
        if int(state[disks-1])<=5 and int(passw[disks-1])>=5:
           moves += x
        else:
            moves += f
    else:
        moves += y
    disks -=1
print(moves)