#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;
	int A[1000001] = {}, B[1000001] = {};
	rep1(i, N) cin >> A[i];
	rep1(i, N) cin >> B[i];

	int kazu = 1;
	rep(i, N) {
		bool are = (A[i] == A[i + 1]) ^ (B[i] == B[i + 1]);
		kazu += are;
	}

	co(kazu / 2);

	Would you please return 0;
}