#include <iostream>
#include <algorithm>
#include <string>
#include <map>

using namespace std;

string mor[32], str, aux;
map <string, int> mp;

int main ()
{
    for (int i = 0; i < 26; ++i)
    {
        char a;
        cin >> a >> mor[i];
    }

    int n;
    cin >> n;

    int ma = -1;
    for (int i = 1; i <= n; ++i)
    {
        cin >> str;
        aux.clear ();

        for (int j = 0; j < str.size (); ++j)
            aux += mor[str[j] - 'a'];

        ma = max (ma, ++mp[aux]);
    }

    if (ma == 1) ma = -1;
    printf ("%d\n", ma);

    return 0;
}