Two Strings Swaps

You are given two strings aa and bb consisting of lowercase English letters, both of length nn . The characters of both strings have indices from 11 to nn , inclusive.

You are allowed to do the following changes:

• Choose any index ii (1≤i≤n1≤i≤n ) and swap characters aiai and bibi ;
• Choose any index ii (1≤i≤n1≤i≤n ) and swap characters aiai and an−i+1an−i+1 ;
• Choose any index ii (1≤i≤n1≤i≤n ) and swap characters bibi and bn−i+1bn−i+1 .

Note that if nn is odd, you are formally allowed to swap a⌈n2⌉a⌈n2⌉ with a⌈n2⌉a⌈n2⌉ (and the same with the string bb ) but this move is useless. Also you can swap two equal characters but this operation is useless as well.

You have to make these strings equal by applying any number of changes described above, in any order. But it is obvious that it may be impossible to make two strings equal by these swaps.

In one preprocess move you can replace a character in aa with another character. In other words, in a single preprocess move you can choose any index ii (1≤i≤n1≤i≤n ), any character cc and set ai:=cai:=c .

Your task is to find the minimum number of preprocess moves to apply in such a way that after them you can make strings aa and bb equal by applying some number of changes described in the list above.

Note that the number of changes you make after the preprocess moves does not matter. Also note that you cannot apply preprocess moves to the string bb or make any preprocess moves after the first change is made.

Input

The first line of the input contains one integer nn (1≤n≤1051≤n≤105 ) — the length of strings aa and bb .

The second line contains the string aa consisting of exactly nn lowercase English letters.

The third line contains the string bb consisting of exactly nn lowercase English letters.

Output

Print a single integer — the minimum number of preprocess moves to apply before changes, so that it is possible to make the string aa equal to string bb with a sequence of changes from the list above.

Examples

Input

7
abacaba
bacabaa

Output

4

Input

5
zcabd
dbacz

Output

0

Note

In the first example preprocess moves are as follows: a1:=a1:= 'b', a3:=a3:= 'c', a4:=a4:= 'a' and a5:=a5:= 'b'. Afterwards, a=a= "bbcabba". Then we can obtain equal strings by the following sequence of changes: swap(a2,b2)swap(a2,b2) and swap(a2,a6)swap(a2,a6) . There is no way to use fewer than 44 preprocess moves before a sequence of changes to make string equal, so the answer in this example is 44 .

In the second example no preprocess moves are required. We can use the following sequence of changes to make aa and bb equal: swap(b1,b5)swap(b1,b5) , swap(a2,a4)swap(a2,a4) .

这个题意都可以理解，给你长度为n的两个字符，然后让你通过变换使字符a和字符b一样，问你需要变换的次数。其实这道题我开始做的时候写跑偏了（考虑的情况不够），后来看了人家的思路才做对（https://blog.csdn.net/C20190102/article/details/81128440）。操作的重点在于它从两边向中间进行查找，每次去比对a[i]，a[n-i+1]，同样b数组也是一样的操作，如果a数组的那对和b数组的那对相等，那么就不需要改变字符，如果有一对相等(且不是a数组的那对)那么我们需要改变一个字符，否则需要改变两个。

#include<stdio.h>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
#define M 100000
char a[M+10],b[M+10];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s%s",a,b);
        int sum=0;
        for(int i=0; i<n/2; i++)
        {
            int l=i,r=n-i-1;
            if (a[l]==b[l]&&a[r]==b[r]|| a[l] == b[r] && a[r] == b[l]|| a[l] == a[r] && b[l] == b[r])
                continue;
            else if (a[l] == b[l] || a[l] == b[r] || a[r] == b[l]|| a[r] == b[r] || b[l] == b[r])
                sum++;
            else
                sum+=2;
        }
        if(n%2&&a[n/2]!=b[n/2])
            sum++;
        printf("%d\n",sum);
    }
    return 0;
}