import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

from collections import Counter

n = II()
ss = LI()
tt = LI()
cs = Counter(ss)
ct = Counter(tt)

if ct[2]: cs, ct = ct, cs

if cs[2] and ct[2]:
    ans = n*(cs[2]+ct[2])-cs[2]*ct[2]
elif cs[2]:
    ans = n*cs[2]+cs[1]
else:
    ans = max(cs[1], ct[1])

print(ans)