Codeforces 540A

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?

Input

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.

Output

Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.

Examples

input

5
82195
64723

output

13

Note

In the sample he needs 13 moves:

• 1 disk: 
• 2 disk: 
• 3 disk: 
• 4 disk: 
• 5 disk: 

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
char a[1001],b[1001];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        scanf("%s%s",&a,&b);
        int s=0;
        for(int i=0;i<n;i++){
            int x=(int)a[i]-'0';
            int y=(int)b[i]-'0';
            if(x<y) swap(x,y);
            s+=min(x-y,10+y-x);
        }
        printf("%d
",s);
    }
    return 0;
}