#include<bits/stdc++.h>
#define ll   long long
const ll N=5e3;
using namespace std;
ll n,m,a[N+5],b[N+5],dp[N+5][N+5][2];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		dp[i][0][a[i]]=dp[i-1][0][a[i-1]]+(a[i]==a[i-1]);
		dp[i][0][!a[i]]=0x3f3f3f3f3f3f3f3f;
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>b[i];
		dp[0][i][b[i]]=dp[0][i-1][b[i-1]]+(b[i]==b[i-1]);
		dp[0][i][!b[i]]=0x3f3f3f3f3f3f3f3f;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			for(int k=0;k<=1;k++){
				dp[i][j][k]=min(a[i]==k?min(dp[i-1][j][(bool)k]+1,dp[i-1][j][!(bool)k]):0x3f3f3f3f3f3f3f3f,b[j]==k?min(dp[i][j-1][(bool)k]+1,dp[i][j-1][!(bool)k]):0x3f3f3f3f3f3f3f3f);
			}
		}
	}
	cout<<n+m+min(dp[n][m][1],dp[n][m][0]);
	return 0;
}