#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}


template<class T>
vector<pair<T, ll>> runLength(const vector<T>& xs) {
  vector<pair<T, ll>> res;
  for (auto x : xs) {
    if (res.empty() || res.back().first != x) {
      res.push_back({x, 1});
    } else {
      ++res.back().second;
    }
  }
  return res;
}


int main2() {
  int N = nextLong();
  vector<int> a(N), b(N), c(N);
  REP(i, N) a[i] = nextLong();
  REP(i, N) b[i] = nextLong();
  REP(i, N) c[i] = a[i] != b[i];
  auto r = runLength(c);

  int ans = 0;
  REP(i, r.size()) if (r[i].first == 1) ans++;
  cout << ans << endl;
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}