#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using graph = vector<vector<int>>;

const ll mod = 1000000007;
const int INF = 1001001001;

int main(){
    int n; cin >> n;
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    bool suc = false;
    int cnt = 0;
    for(int i = 0; i < n; i++){
        //cout << a[i] << " " << b[i] << endl;
        if(!suc && a[i] != b[i]){
            cnt++;
            suc = true;
        }
        if(a[i] == b[i]) suc = false;

    }
    cout << cnt << endl;
}