#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n;
llint s[505], t[505];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> s[i];
	for(int i = 1; i <= n; i++) cin >> t[i];
	
	llint smax = 0, tmax = 0;
	for(int i = 1; i <= n; i++) smax = max(smax, s[i]);
	for(int i = 1; i <= n; i++) tmax = max(tmax, t[i]);
	
	if(smax == 2 && tmax == 2){
		llint scnt = 0, tcnt = 0;
		for(int i = 1; i <= n; i++) if(s[i] == 2) scnt++;
		for(int i = 1; i <= n; i++) if(t[i] == 2) tcnt++;
		cout << (scnt + tcnt) * n - scnt * tcnt << endl;
		return 0;
	}
	if(smax == 0 && tmax == 0){
		cout << 0 << endl;
		return 0;
	}
	if(smax == 1 && tmax == 1){
		llint scnt = 0, tcnt = 0;
		for(int i = 1; i <= n; i++) if(s[i] == 1) scnt++;
		for(int i = 1; i <= n; i++) if(t[i] == 1) tcnt++;
		cout << max(scnt, tcnt) << endl;
		return 0;
	}
	
	llint ans = 0;
	if(smax == 2){
		for(int i = 1; i <= n; i++){
			if(s[i] == 1) ans++;
			if(s[i] == 2) ans += n;
		}
	}
	if(tmax == 2){
		for(int i = 1; i <= n; i++){
			if(t[i] == 1) ans++;
			if(t[i] == 2) ans += n;
		}
	}
	cout << ans << endl;
	
	return 0;
}