#include<bits/stdc++.h>
using namespace std;
int dp[5005][5005][2];
int n,m,a[5005],b[5005];
const int inf=1e9;
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);//IO优化 
	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=0;i<=n;++i){
		for(int j=0;j<=m;++j){
			if(i==0&&j==0) continue;//这种情况不存在 
			dp[i][j][0]=inf;
			//为防止代码过长，加以适当简化 
			if(i){
				dp[i][j][0]=min(dp[i][j][0],dp[i-1][j][0]+1+(bool)(a[i]==a[i-1]));
				dp[i][j][0]=min(dp[i][j][0],dp[i-1][j][1]+1+(bool)(a[i]==b[j]));
			}
			dp[i][j][1]=inf;
			if(j){
				dp[i][j][1]=min(dp[i][j][1],dp[i][j-1][1]+1+(bool)(b[j]==b[j-1]));
				dp[i][j][1]=min(dp[i][j][1],dp[i][j-1][0]+1+(bool)(b[j]==a[i]));
			}
		}
	}
	cout<<min(dp[n][m][0],dp[n][m][1]);//输出最优方案 
	return 0;
}