#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long mod = 1e9 + 7;
const int alphabet = 26;
const int inf = INT_MAX;
const long long linf = 1e18 + 9;
namespace util {
inline long long cnm(char ch) { return (ch - '0'); }
inline long long cap(char ch) { return (ch - 'a'); }
inline void instr(string& s, long long& n) {
  cin >> s;
  n = s.length();
}
inline void instr(string& s) { cin >> s; }
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
bool min(T a, T b, T c) {
  return std::min(a, std::min(b, c));
}
}  // namespace util
using namespace util;
void solve() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long i, j, k, m, n, q;
  cin >> n;
  vector<string> vs(n);
  map<string, set<int> > god;
  map<string, string> file;
  for (i = 0; i < n; i++) {
    cin >> vs[i];
    for (j = 0; j < vs[i].size(); j++) {
      string cur = "";
      for (k = j; k < vs[i].size(); k++) {
        cur += vs[i][k];
        god[cur].insert(i);
        if (file.find(cur) == file.end()) file[cur] = vs[i];
      }
    }
  }
  cin >> q;
  while (q--) {
    string qs;
    cin >> qs;
    if (god.find(qs) == god.end())
      cout << "0 -"
           << "\n";
    else {
      cout << god[qs].size() << " " << file[qs] << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
