#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;



int main(){
    ll n;
    cin >> n;
    vector<ll>a(n),b(n);
    rep(i,n)cin>>a[i];
    rep(i,n)cin>>b[i];
    ll cnt = 0;
    vector<bool>same;
    same.push_back(true);
    rep(i,n){
        if(a[i]==b[i]){
            same.push_back(true);
        }
        else{
            same.push_back(false);
        }
    }
    same.push_back(true);
    rep(i,n+1){
        if(same[i]&&(!same[i+1]))cnt++;
    }
    cout << cnt << endl;
    return 0;
}