N = gets.to_i
S = gets.split.map(&:to_i)
T = gets.split.map(&:to_i)

counter_r = S.tally
counter_h = T.tally

counter_r.default = 0
counter_h.default = 0

ans = 0
ans += N * counter_r[2]
ans += (N - counter_r[2]) * counter_h[2]

if counter_r[2] > 0 && counter_h[2] == 0
  ans += counter_r[1]
elsif counter_h[2] > 0 && counter_r[2] == 0
  ans += counter_h[1]
elsif counter_h[2] == 0 && counter_r[2] == 0
  ans += [counter_r[1], counter_h[1]].max
end

puts ans