#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;
using ll = long long;

int main(){

    int N, ans=0;
    bool f=0;
    string S, T;
    cin >> N >> S >> T;

    for (auto c : S) f ^= c-'0';
    for (auto c : T) f ^= c-'0';

    if (f) reverse(S.begin(), S.end());
    for (int i=0; i<N; i++) if (S[i] != T[i]) ans++;

    cout << ans << endl;

    return 0;
}