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.
# -*- coding: utf-8 -*-
"""
Created on Fri Oct 16 08:20:44 2020

@author: HP
"""


num=int(input())
a=("0123456789")
key1=input()
key2=input()
min=0
dis=0
for i in range(0,num):
    clock=abs(a.index(key1[i])-a.index(key2[i]))
    antiClock=0
    if a.index(key1[i])<a.index(key2[i]):
        antiClock= a.index(key1[i])+(10-a.index(key2[i]))
    elif a.index(key1[i])>a.index(key2[i]):
        antiClock= a.index(key2[i])+(10-a.index(key1[i]))
    dis= clock
    
    if clock>antiClock :
        dis= antiClock
    min=min+dis
print(min)