#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

ll find_num(vec &a){
    return a[2] * N + a[1];
}

int main() {
    cin>>N;
    vec s(3, 0), t(3, 0);
    rep(i, N){cin>>A; ++s[A];}
    rep(i, N){cin>>A; ++t[A];}
    ll res(0);
    if(s[2] && t[2]){
        res = N * (s[2] + t[2]) - s[2] * t[2];
    }else{
        res = max(find_num(s), find_num(t));
    }
    cout<<res<<endl;
}