#include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define RREP(i,n) for(int i=int(n)-1; i>=0; i--)
#define FOR(i,f,t) for(int i=int(f); i<=int(t); i++)
#define RFOR(i,f,t) for(int i=int(f); i>=int(t); i--)
#define ALL(vec) (vec).begin(),(vec).end()
#define ASORT(vec) sort(ALL(vec))
#define DSORT(vec) sort(ALL(vec), greater<int>());
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define YES(ans) if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define Yes(ans) if(ans) cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define yes(ans) if(ans) cout<<"yes"<<endl; else cout<<"no"<<endl;

int main() {
    int n;
    cin >> n;
    vector<int> A(n);
    vector<int> B(n);
    REP(i, n) cin >> A.at(i);
    REP(i, n) cin >> B.at(i);

    vector<int> data(n);
    REP(i, n) {
        if( A.at(i) == B.at(i) ) data.at(i) = 0;
        else data.at(i) = 1;
    }

    int count=0;
    REP(i, n-1) if( data.at(i) == 0 && data.at(i+1) == 1 ) count++;
    if( data.at(0) == 1 ) count++;

    cout << count << endl;
}