#include using namespace std; #pragma region Macros #define ios\ ios::sync_with_stdio(false);\ cin.tie(nullptr); #define VEC(type, name, size)\ V name(size);\ IN(name) #define VVEC(type, name, h, w)\ VV name(h, V(w));\ IN(name) #define INT(...)\ int __VA_ARGS__;\ IN(__VA_ARGS__) #define LL(...)\ ll __VA_ARGS__;\ IN(__VA_ARGS__) #define STR(...)\ string __VA_ARGS__;\ IN(__VA_ARGS__) #define CHAR(...)\ char __VA_ARGS__;\ IN(__VA_ARGS__) #define DOUBLE(...)\ DOUBLE __VA_ARGS__;\ IN(__VA_ARGS__) #define LD(...)\ LD __VA_ARGS__;\ IN(__VA_ARGS__) template void scan(T &a) { cin >> a; } template void scan(vector &a) { for(auto &i : a) scan(i); } template void scan(pair &p){ scan(p.first); scan(p.second); } void IN() {} template void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); } template inline void print(T &x){ cout << x << '\n';} #define ll long long #define ld long double #define FOR(i,l,r) for(ll i=(l);i<(r);++i) #define REP(i,n) FOR(i,0,n) #define REPS(i,n) FOR(i,1,n+1) #define RFOR(i,l,r) for(ll i=(l);i>=(r);--i) #define RREP(i,n) RFOR(i,n-1,0) #define RREPS(i,n) RFOR(i,n,1) #define pb push_back #define eb emplace_back #define SZ(x) ((ll)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() template using V = vector; template using VV = V>; template inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; } template inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; } inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';} inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';} inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}} template inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}} template T Roundup_div(T x, T y) {return (x+(y-1))/y;} template T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; } const ll INF = 1e18; #pragma endregion ll xc1, xc2, yc1, yc2; int main(){ ios; INT(n); VEC(int, s, n); VEC(int ,t, n); assert(1 <= n and n <= 500); REP(i, n) assert(0 <= s[i] and s[i] <= 2); REP(i, n) assert(0 <= t[i] and t[i] <= 2); REP(i, n) if(s[i] == 1) xc1++; REP(i, n) if(t[i] == 1) yc1++; REP(i, n) if(s[i] == 2) xc2++; REP(i, n) if(t[i] == 2) yc2++; if(xc2 and yc2){ cout << n * (xc2 + yc2) - xc2 * yc2 << endl; return 0; } if(xc2 > 0){ cout << xc2 * n + xc1 << endl; return 0; } if(yc2 > 0){ cout << yc2 * n + yc1 << endl; return 0; } cout << max(xc1, yc1) << endl; }