#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());

template<class T> inline void chmin(T& a, T b){
    if (a > b){
        a = b;
    }
}

template<class T> inline void chmax(T& a, T b){
    if (a < b){
        a = b;
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<fixed<<setprecision(12);
    ll N;
    cin >> N;
    vector<ll> S(N);
    vector<ll> T(N);
    REP(i,N)cin >> S[i];
    REP(i,N)cin >> T[i];
    ll St = 0,Tt = 0,So = 0,To = 0;;
    REP(i,N){
        if(S[i] == 2){
            St += 1;
        }
        if(T[i] == 2){
            Tt += 1;
        }
        if(S[i] == 1){
            So += 1;
        }
        if(T[i] == 1){
            To += 1;
        }
    }
    ll ans = Tt*N + St * N - St*Tt;
    if(St == 0 && Tt == 0){
        ans += max(So,To);
    }else if(St == 0){
        ans += To;
    }else if(Tt == 0){
        ans += So;
    }
    cout << ans << "\n";
}