#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;
//using namespace atcoder;

void solve(){
	int n;
	cin>>n;
	vector<int>s(n),t(n);
	rep(i,n)cin>>s[i];
	rep(i,n)cin>>t[i];
	sort(all(s));sort(all(t));
	int ans=0;
	if(s.back()==2&&t.back()==2){
		int two=0;
		rep(i,n)if(s[i]==2)++two;
		ans+=two*n;
		rep(i,n)if(t[i]==2)ans+=(n-two);
	}
	else if(s.back()==2||t.back()==2){
		rep(i,n){
			if(s[i]==2||t[i]==2)ans+=n;
			else {
				if(s.back()==2&&s[i]==1)++ans;
				else if(t.back()==2&&t[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<<"\n";
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}