#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<math.h>
#include<set>
#include<string>
#include<queue>
#include<complex>
#include<numeric>
#include<stack>
#include<map>
using namespace std;
#define rep(i,n) for(ll i = 0;i<n;i++)
#define req(i,n) for(ll i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define ALL(a) a.begin(),a.end()
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; }
typedef long long ll;
typedef long double ld;
int main() {
    int n; cin >> n; vector<int> a(n), b(n);
    rep(i, n) cin >> a[i];
    int cnt = 0, ans = 0;
    rep(i, n) {
        cin >> b[i];
        if (a[i] != b[i]) {
            if (cnt == 0) ans++, cnt = 1;
        }if (cnt > 0 && a[i] == b[i]) cnt = 0;
    }cout << ans << endl;
}