#include"bits/stdc++.h"

using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pll = pair<ll, ll>;
using tp3 = tuple<ll, ll, ll>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1ll << 60;
constexpr int dh[4] = { 0,1,0,-1 };
constexpr int dw[4] = { -1,0,1,0 };
bool isin(const int H, const int W, const int h, const int w) {
    return 0 <= h && h < H && 0 <= w && w < W;
}
// ============ template finished ============
using ar3 = array<int, 3>;
ar3 count(vector<int>& v) {
    ar3 ar;
    rep(i, 3)ar[i] = 0;
    for (auto num : v)ar[num]++;
    return ar;
}

int main()
{
    int N;
    cin >> N;
    vector<int> S(N), T(N);
    rep(i, N)cin >> S[i];
    rep(i, N)cin >> T[i];
    auto cntS = count(S);
    auto cntT = count(T);
    ll res = [&]() {
        if (cntS[2] > 0 && cntT[2] > 0) {
            auto alpha = cntS[2];
            auto beta = cntT[2];
            return (alpha + beta)*N - alpha * beta;
        }
        if (cntS[2] > 0 || cntT[2] > 0) {
            auto alpha = cntS[2] > 0 ? cntS : cntT;
            return alpha[2] * N + alpha[1];
        }
        return max(cntS[1], cntT[1]);
    }();
    cout << res << endl;
    return 0;
}