#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cmath> #include <map> #include <queue> #include <iomanip> #include <set> #include <tuple> #define mkp make_pair #define mkt make_tuple #define rep(i,n) for(int i = 0; i < (n); ++i) #define all(v) v.begin(),v.end() using namespace std; typedef long long ll; const ll MOD=1e9+7; template<class T> void chmin(T &a,const T &b){if(a>b) a=b;} template<class T> void chmax(T &a,const T &b){if(a<b) a=b;} int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin>>N; vector<int> S(N),T(N); rep(i,N) cin>>S[i]; rep(i,N) cin>>T[i]; vector<int> sn(3,0),tn(3,0); rep(i,N){ sn[S[i]]++; tn[T[i]]++; } if(sn[2]&&tn[2]){ int ans=sn[2]*N+tn[2]*N-sn[2]*tn[2]; cout<<ans<<"\n"; }else if(sn[2]){ int ans=sn[2]*N+sn[1]; cout<<ans<<"\n"; }else if(tn[2]){ int ans=tn[2]*N+tn[1]; cout<<ans<<"\n"; }else{ int ans=max(sn[1],tn[1]); cout<<ans<<"\n"; } return 0; }