#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));

    int cnt = 0, tmp1 = 0, tmp2 = 0;

    rep(i, N) {
        cin >> S[i];
        if (S[i] == 2) {
            cnt += N;
        }
        if (S[i] == 1)
            tmp1++;
    }

    rep(i, N) {
        cin >> T[i];
        if (T[i] == 2) {
            cnt += N;
        }
        if (T[i] == 1)
            tmp2++;
    }

    cnt += min(tmp1, tmp2);
    cout << cnt << endl;
}