#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
int n,m,a[5001],b[5001];
int dp[5001][5001];
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	for(int i=1;i<=n;i++){
		if(a[i]==0)	dp[i][0]=(dp[i-1][0]+2)/2*2;
		if(a[i]==1)	dp[i][0]=(dp[i-1][0]+1)/2*2+1;
	}
	for(int i=1;i<=m;i++){
		if(b[i]==0)	dp[0][i]=(dp[0][i-1]+2)/2*2;
		if(b[i]==1)	dp[0][i]=(dp[0][i-1]+1)/2*2+1;		
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int x,y;
			if(a[i]==0){
				x=(dp[i-1][j]+2)/2*2;
			}
			if(a[i]==1){
				x=(dp[i-1][j]+1)/2*2+1;
			}
			if(b[j]==0){
				y=(dp[i][j-1]+2)/2*2;
			}
			if(b[j]==1){
				y=(dp[i][j-1]+1)/2*2+1;
			}
			dp[i][j]=min(x,y);
		}
	}
	cout<<dp[n][m];
	return 0;
}