#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5;
ll n,m,cnt=0,num=0,ans=0,j=1,minn=N;
string s;
unordered_map<string,ll>ump;
map<string,ll>mp;
string article[N];
int main(){
	cin>>n;
	for(ll i=1;i<=n;i++){
		cin>>s;
		ump[s]=1;
	} 
	cin>>m;
	for(ll i=1;i<=m;i++){
		cin>>article[i];
		if(mp.find(article[i])==mp.end()) cnt++;
		mp[article[i]]=0;
	}
	cout<<cnt<<endl;
	for(ll i=1;i<=m;i++){
		if(mp[article[i]]==0) num++;
		mp[article[i]]++;
		ans++;
		if(num==cnt){
			while(1){
				if(mp[article[j]]>1){
					mp[article[j]]--;
					j++;
					ans--;
				}else break;
			}
			minn=min(minn,ans);
		}
	}
	cout<<minn;
	return 0;
}