/*****************************************
Note:
******************************************/
#include <queue>
#include <set>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int n,m,cnt;
double p;
map<string,bool> ma;
string s,s2;
int main()
{
//	freopen("pjesma.in","r",stdin);
//	freopen("pjesma.out","w",stdout);
	cin>>n;
	p=n*1.0/2;
	for(int i=1;i<=n;++i)
	{
		cin>>s;
		ma[s]=1;
	}
	cin>>m;
	for(int i=1;i<=m;++i)
	{
		cin>>s2;
		if(ma[s2]==0) continue;
		if(++cnt>=p)
		{
			cout<<i<<endl;
			return 0;
		}
		ma[s2]=0;
	}
	return 0;
}