#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)n - 1; i > -1; i--)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

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

    int N;
    cin >> N;
    vector<int> S(N), T(N);
    vector<vector<int>> mat(N, vector<int>(N, 0));

    rep(i, N) { cin >> S[i]; }

    rep(i, N) { cin >> T[i]; }

    int a = count(all(S), 2), b = count(all(T), 2), c = count(all(S), 1),
        d = count(all(T), 1);
    if (a && b) {
        cout << N * (a + b) - a * b << endl;
    } else if (a) {
        cout << N * a + c << endl;
    } else if (b) {
        cout << N * b + d << endl;
    } else {
        cout << max(c, d) << endl;
    }
}