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.
import math, heapq
from sys import stdin	
from collections import Counter, defaultdict, deque, namedtuple
from bisect import bisect_right, bisect_left
from typing import List, DefaultDict
from itertools import permutations
 
 
 
def readarray(typ):
    return list(map(typ, stdin.readline().split()))


def readint():
    return int(input())


n = readint()

org = input()
sec = input()

ans = 0

for i in range(n):
    original = int(org[i])
    current = int(sec[i])

    up, down = current, current

    upMoves, downMoves = 0, 0

    for j in range(9):

        if up != original:
            up -= 1
            upMoves += 1
        
        if down != original:
            down += 1
            downMoves += 1

        if up == -1:
            up = 9
        
        if down == 10:
            down = 0
    
    ans += min(upMoves, downMoves)

print(ans)
    

