#include #define rep(i, n) for (int i = 0; i < n; i++) using namespace std; typedef long long ll; int main() { int N, S, T; vector s(3, 0), t(3, 0); cin >> N; rep(i, N) { cin >> S; s[S]++; } rep(i, N) { cin >> T; t[T]++; } if (s[0] > 0) { if (t[0] > 0) { cout << max(s[1], t[1]) << "\n"; } else { cout << s[2] * N + s[1] << "\n"; } } else { if (t[0] > 0) { cout << t[2] * N + t[1] << "\n"; } else { cout << (s[1] + s[2]) * (t[1] + t[2]) - s[1] * t[1] << "\n"; } } }