#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; int main() { vector<string> rep(26); for(int i=0;i<26;++i){ string let; cin>>let; cin>>(rep[let[0]-'a']); } int n; cin>>n; vector<pair<string,string> > v(n); for(int i=0;i<n;++i){ string &w = v[i].second; cin>>w; string &r = v[i].first; r.reserve(4*w.size()); for(char c : w){ r += rep[c-'a']; } } sort(v.begin(),v.end()); int mx=0; for(int i=0;i<n;){ int j; for(j=i; j+1<n && v[j+1].first==v[i].first; ++j) ; mx=max(mx,j-i+1); i=j+1; } cout<<mx<<'\n'; }