#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; constexpr double PI = 3.14159265358979323846; int s[3]; int t[3]; int main(){ int n; cin >> n; rep(i,n){ int ss; cin >> ss; s[ss] ++; } rep(i,n){ int tt; cin >> tt; t[tt] ++; } if(t[2]>0&&s[2]>0){ cout << (t[2]+s[2])*n - t[2] - s[2] << endl; }else if(t[2]>0){ cout << t[2]*n + t[1] << endl; }else if(s[2]>0){ cout << s[2]*n + s[1] << endl; }else{ cout << max(s[1],t[1]) << endl; } return 0; }