CodeForces 1006D

D. Two Strings Swaps

You are given two strings a and b consisting of lowercase English letters, both of length n. The characters of both strings have indices from 1 to n, inclusive.

You are allowed to do the following changes:

Choose any index i (1≤i≤n) and swap characters ai and bi;
Choose any index i (1≤i≤n) and swap characters ai and an−i+1;
Choose any index i (1≤i≤n) and swap characters bi and bn−i+1.
Note that if n is odd, you are formally allowed to swap a⌈n2⌉ with a⌈n2⌉ (and the same with the string b) 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 a with another character. In other words, in a single preprocess move you can choose any index i (1≤i≤n), any character c and set ai:=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 a and b 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 b or make any preprocess moves after the first change is made.

Input

The first line of the input contains one integer n (1≤n≤105) — the length of strings a and b.

The second line contains the string a consisting of exactly n lowercase English letters.

The third line contains the string b consisting of exactly n 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 a equal to string b 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:=‘b’, a3:=‘c’, a4:=‘a’ and a5:=‘b’. Afterwards, a=“bbcabba”. Then we can obtain equal strings by the following sequence of changes: swap(a2,b2) and swap(a2,a6). There is no way to use fewer than 4 preprocess moves before a sequence of changes to make string equal, so the answer in this example is 4.

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

思路

题目大意是说，有两个字符串，我们能进行三种操作：第一种，将 a[i] 和 b[i] 的单个字符交；第二种，将 a[i] 和 a[n-i-1] 的单个字符交换；第三种，将 b[i] 和 b[n-i-1] 的单个字符交换。但是题目的要求是，让我们先做预处理替换a中的字符，再进行如上三种操作，能让字符串 a == b ，求预处理的次数。
上述的后两种操作都是从两头往中间拱，所以可以找到一个规律，将 a[i] 、 a[n-i-1] 、 b[i] 、 b[n-i-1] 这四个字符作对比，因为只能替换a，所以在不考虑b[i] = b[n-i-1] 的前提下，四个字符有n对相同的（不能交叉，如 a[i] = b[n-i-1] 和 a[n-i-1] = b[i] ），而有相同组数则可以减少2-n次预处理（全处理一组需要处理2次）。

代码

#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 100000+5
typedef long long ll;

char a[maxn];
char b[maxn];

int main() {
	int n;
    cin >> n;
	cin >> a >> b;
    ll total = 0;
    for (int i = 0; i < n / 2; i++) {
		int l = i;
		int 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]) {
			total ++;
		}
		else {
			total += 2;
		}
    }
    if (n % 2 == 1 && a[n / 2] != b[n / 2]) { 
		total ++;
	}
    cout << total << endl;
}

题目来源

CodeForces 1006D Two Strings Swaps