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
from collections import OrderedDict
from collections import Counter
from itertools import combinations
from itertools import accumulate
import operator
import bisect
from collections import deque
import copy
from itertools import permutations
from operator import itemgetter
mod=pow(10,9)+7
#a= list(map(int, input("").strip().split()))[:n]
'''
def solve(n,m,k):

        
    
t=int(input(""))
for _ in range(t):
    n,m,k=list(map(int, input("").strip().split()))[:3]
    solve(n,m,k)
'''
def solve(a,b):
    d=[i for i in range(10)]
    d=d+d
    c=0
    for i,j in zip(a,b):
        m=d.index(j)
        n=len(d)-1-d[::-1].index(j)
        k=d.index(i)
        l=len(d)-1-d[::-1].index(i)
        c+=min(abs(k-m),abs(k-n),abs(l-m),abs(l-n))
    print(c)
n=input("")
a=list(map(int,input("").strip()))
b=list(map(int,input("").strip()))
solve(a,b)
