#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>

#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
const double PI = acos(-1);
const ll mod = 1000000007;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];

    bool is_same_last = true;
    int cnt = 0;
    rep(i, n) {
        bool is_same = (a[i] == b[i]);
        if (is_same_last && !is_same) cnt++;
        is_same_last = is_same;
    }
    cout << cnt << endl;
    return 0;
}