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 sys
from sys import stdin,stdout
import math
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()

def code(n,p,q):
    c = 0
    a = list(map(int, p))
    b = list(map(int, q))
    for i in range(n):
        c+=min(abs(a[i]-b[i]),min(abs(10-(b[i]-a[i])),abs(10-(a[i]-b[i]))))
    return c


if __name__ == '__main__':
    n = int(input())
    p = get_string()
    q = get_string()
    ans = code(n,p,q)
    print(ans)
