#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
mt19937 rng(
    (unsigned int)chrono::steady_clock::now().time_since_epoch().count());
long long power(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      result *= a;
    }
    a *= a;
    b /= 2;
  }
  return result;
}
long long gcd(long long x, long long y) {
  long long r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
long long countSetBits(long long x) {
  long long Count = 0;
  while (x > 0) {
    if (x & 1) Count++;
    x = x >> 1;
  }
  return Count;
}
bool isPerfectSquare(long long n) {
  long long sr = sqrt(n);
  if (sr * sr == n)
    return true;
  else
    return false;
}
long long mod(long long x, long long M) { return ((x % M + M) % M); }
long long add(long long a, long long b, long long M) {
  return mod(mod(a, M) + mod(b, M), M);
}
long long mul(long long a, long long b, long long M) {
  return mod(mod(a, M) * mod(b, M), M);
}
long long powerM(long long a, long long b, long long M) {
  long long res = 1ll;
  while (b) {
    if (b % 2ll == 1ll) {
      res = mul(a, res, M);
    }
    a = mul(a, a, M);
    b /= 2ll;
  }
  return res;
}
long long mod_inv(long long a, long long m) {
  long long g = m, r = a, x = 0, y = 1;
  while (r != 0) {
    long long q = g / r;
    g %= r;
    swap(g, r);
    x -= q * y;
    swap(x, y);
  }
  return mod(x, m);
}
long long nCr(long long n, long long k) {
  if (n < k) return 0;
  if (k == 0) return 1;
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long modInverse(long long n, long long M) { return powerM(n, M - 2, M); }
vector<long long> factu;
void factcalc(long long n, long long M) {
  factu.resize(n + 1);
  factu[0] = 1;
  for (long long i = 1; i <= n; i++) {
    factu[i] = mul(factu[i - 1], i, M);
  }
}
long long nCrM(long long n, long long r, long long M) {
  if (n < r) return 0;
  if (r == 0) return 1;
  return mul(mul(factu[n], modInverse(factu[r], M), M),
             modInverse(factu[n - r], M), M);
}
long long rand_int(long long l, long long r) {
  return uniform_int_distribution<long long>(l, r)(rng);
}
void solve() {
  long long n;
  cin >> n;
  vector<string> v(n);
  vector<long long> p(n);
  for (long long i = 0; i < n; i++) {
    p[i] = i;
    ;
  }
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  long long q;
  cin >> q;
  vector<vector<string>> sto(q);
  for (long long i = 0; i < q; i++) {
    long long x;
    cin >> x;
    sto[i].resize(x);
    for (long long j = 0; j < x; j++) {
      cin >> sto[i][j];
    }
  }
  vector<vector<long long>> ans(q);
  set<long long> s;
  do {
    long long y = 0;
    for (long long i = 0; i < n; i++) {
      for (long long j = i + 1; j < n; j++) {
        if (p[j] < p[i]) {
          y++;
        }
      }
    }
    for (long long i = 0; i < q; i++) {
      long long ind = 0;
      for (long long j = 0; j < sto[i].size() && ind < n; j++) {
        if (sto[i][j] == v[p[ind]]) {
          ind++;
        }
      }
      if (ind == n) {
        s.insert(y);
        ans[i].push_back(y);
      }
    }
  } while (next_permutation(p.begin(), p.end()));
  if (s.size() == 0) {
    cout << "Brand new problem!\n";
    return;
  } else {
    long long op = *(s.begin());
    for (long long i = 0; i < ans.size(); i++) {
      for (long long j = 0; j < ans[i].size(); j++) {
        if (ans[i][j] == op) {
          long long cnt = (nCr(n, 2) - op + 1);
          cout << i + 1 << endl;
          cout << "[:";
          for (long long k = 0; k < cnt; k++) {
            cout << "|";
          }
          cout << ":]\n";
          return;
        }
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(20);
  solve();
  return 0;
}
