#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define rrep(i, r, l) for (int i = (int)(r); i > (int)(l); i--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()


void solve() {
    int n;
    string s, t;
    cin >> n >> s >> t;

    int ans = 1e9;
    rep(i, 0, 2) {
        int now = 0;
        rep(j, 0, n) {
            if (s[j] != t[j]) {
                now++;
            }
        }
        if (now % 2 == i) {
            ans = min(ans, now);
        }
        reverse(s.begin(), s.end());
    }
    cout << ans << '\n';
}

int main() {
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}