#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    vector<int32_t> ts(n);
    for (auto &&t : ts) {
        cin >> t;
    }
    for (auto &&t : ts) {
        int32_t b;
        cin >> b;
        t ^= b;
    }
    auto end = unique(ts.begin(), ts.end());
    int32_t ans = 0;
    for (auto it = ts.begin(); it != end; ++it) {
        ans += *it;
    }
    cout << ans << endl;
    return 0;
}