#include <iostream>
#include <string>
#include <cassert>
#include <algorithm>
using namespace std;

int main(){
    int N;
    string S;
    string T;
    cin >> N;
    cin >> S;
    cin >> T;
    assert(1 <= N && N <= 1000000);
    assert(S.size() == N);
    assert(T.size() == N);

    int parity_s = 0;
    int parity_t = 0;
    for (int i = 0; i < N; i++){
        assert(S[i] == '0' || S[i] == '1');
        assert(T[i] == '0' || T[i] == '1');
        if (S[i] == '1') parity_s++;
        if (T[i] == '1') parity_t++;
    }

    if (parity_s % 2 == parity_t % 2){
        int ans = 0;
        for (int i = 0; i < N; i++){
            if (S[i] != T[i]) ans++;
        }
        cout << ans << endl;
    }
    else{
        reverse(S.begin(), S.end());
        int ans = 0;
        for (int i = 0; i < N; i++){
            if (S[i] != T[i]) ans++;
        }
        cout << ans << endl;
    }
}