#include "bits/stdc++.h"
using namespace std;
using     ll=long long;
using    vll=vector<   ll>;
using   vvll=vector<  vll>;
using  vvvll=vector< vvll>;
using vvvvll=vector<vvvll>;
constexpr ll INF = 1LL << 60;
struct Fast{ //cin,cout高速化のおまじない＋桁数指定
	Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(std::numeric_limits<double>::max_digits10); }
} fast;
#define rep(i, S, E)  for (ll i = (S); i <= (E); i++)
#define dep(i, E, S)  for (ll i = (E); i >= (S); i--)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
template<class T> inline T POW(T a, ll n){ T r=1; for (; n>0; n>>=1, a*=a){ if (n&1)r*=a; } return r; }
inline ll POW(int a, ll n){ return POW((ll)a, n); }
inline ll CEIL(ll a, ll b){ return (a+b-1)/b; }



void solve()
{
	ll n;  cin >> n;
	vector<ll> s(n);  rep(i,0,n-1){ ll s_; cin>>s_; s[i]=s_; }
	vector<ll> t(n);  rep(i,0,n-1){ ll t_; cin>>t_; t[i]=t_; }

	ll cntS0=0;
	ll cntS1=0;
	ll cntS2=0;
	ll cntT0=0;
	ll cntT1=0;
	ll cntT2=0;
	rep(i,0,n-1){
		if (s[i]==0) cntS0++;
		if (s[i]==1) cntS1++;
		if (s[i]==2) cntS2++;
		if (t[i]==0) cntT0++;
		if (t[i]==1) cntT1++;
		if (t[i]==2) cntT2++;
	}

	if (cntS2>0 and cntT2>0){
		ll ans=n*(cntS2+cntT2) - cntS2*cntT2;
		cout << ans << '\n'; return;
	}

	if (cntS0>0 and cntT0>0){
		ll mn=min(cntS0,cntT0);
		ll ans=n-mn;
		cout << ans << '\n'; return;
	}

	if (cntT2>0){
		swap(cntS0,cntT0);
		swap(cntS1,cntT1);
		swap(cntS2,cntT2);
	}
	if (cntS2>0){
		ll ans=cntS2*n+cntS1;
		cout << ans << '\n'; return;
	}

	if (cntT0>0){
		swap(cntS0,cntT0);
		swap(cntS1,cntT1);
		swap(cntS2,cntT2);
	}
	if (cntS0>0){
		if (cntS2==0){
			cout << n << '\n';return;
		}
		else{
			ll ans=cntS2*n+cntS1;
			cout << ans << '\n'; return;
		}
	}
	cout << n << '\n';
}


int main(){
#if 1
	solve();
#else
	ll t;  cin >> t;
	rep(i, 0, t-1){
		solve();
	}
#endif
	return 0;
}