#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    int N, ans=1e9, cnt;
    string S, T;
    cin >> N >> S >> T;
    cnt = 0;
    for (int i=0; i<N; i++) if (S[i] != T[i]) cnt++;
    if (cnt % 2 == 0) ans = min(ans, cnt);

    reverse(S.begin(), S.end());
    cnt = 0;
    for (int i=0; i<N; i++) if (S[i] != T[i]) cnt++;
    if (cnt % 2 == 1) ans = min(ans, cnt);

    cout << ans << endl;

    return 0;
}