#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N;
    cin >> N;
    int cnt1 = 0, cnt2 = 0;
    int S[N], T[N];
    rep(i, N){
        cin >> S[i];
        if(S[i] == 2) cnt1++;
    }
    rep(i, N){
        cin >> T[i];
        if(T[i] == 2) cnt2++;
    }
    int ans = (cnt1+cnt2)*N - cnt1*cnt2;
    if(cnt1 > 0 && cnt2 > 0);
    elif(cnt1 == 0){
        rep(i, N) if(T[i] == 1) ans++;
    }
    elif(cnt2 == 0){
        rep(i, N) if(S[i] == 1) ans++;
    }
    else{
        int a = 0, b = 0;
        rep(i, N){
            if(S[i] == 1) a++;
            if(T[i] == 1) b++;
        }
        ans += max(a, b);
    }
    cout << ans << endl;
}