wa in #1 #2 #6 #7 #8 #10

#include <bits/stdc++.h>
using namespace std;
int n, m;
map <string , int> mp;
string x;
string s[100005];
void intt( int a , int b , int maxn )
{
	cout << a <<" " << b << " " << maxn << endl;
 } 
int main()
{
	cin >> n;
	for( int i = 1 ; i <= n ; i ++ )
	{
		cin >> x;
		mp[x] = -1;
	}
	cin >> m;
	for( int i = 1 ; i <= m ; i ++ )
	{
		cin >> s[i];
	}
	int l = 1, r = 0, ans = 0, a = 1, b = m, maxn = 0;
	while( r < m )
	{
		r ++;
		if( mp[s[r]] == -1 )
		{
			mp[s[r]] = 0;
			ans ++;
		}
		mp[s[r]] ++;
		while( l < r && mp[s[l]] > 1 ) mp[s[l]] --, l ++;
		if( ans == maxn && r - l < b - a || ans > maxn ) a = l, b = r, maxn = ans;
	}
	cout << maxn << endl << b - a + 1;
	
	return 0;
 }