Brand New Easy Problem

Description:

Input:

The first line contains a single integer n (1 ≤ n ≤ 4) — the number of words in Lesha's problem. The second line contains n space-separated words — the short description of the problem.

The third line contains a single integer m (1 ≤ m ≤ 10) — the number of problems in the Torcoder.com archive. Next m lines contain the descriptions of the problems as "k s₁ s₂ ... s_k", where k (1 ≤ k ≤ 20) is the number of words in the problem and s_i is a word of the problem description.

All words from all problem descriptions contain no more than 10 lowercase English letters.

Output:

If Lesha's problem is brand new, print string "Brand new problem!" (without quotes).

Otherwise, on the first line print the index of the archive problem which resembles Lesha's problem most. If there are multiple such problems, print the one with the smallest index. On the second line print a string consisting of characters [:, character | repeated p times, and characters :], where p is the "similarity" between this problem and Lesha's one. The archive problems are numbered starting from one in the order in which they are given in the input.

Sample Input:

4
find the next palindrome
1
10 find the previous palindrome or print better luck next time

Sample Output:

1
[:||||||:]

Sample Input:

3
add two numbers
3
1 add
2 two two
3 numbers numbers numbers

Sample Output:

Brand new problem!

Sample Input:

4
these papers are formulas
3
6 what are these formulas and papers
5 papers are driving me crazy
4 crazy into the night

Sample Output:

1
[:||||:]

Sample Input:

3
add two decimals
5
4 please two decimals add
5 decimals want to be added
4 two add decimals add
4 add one two three
7 one plus two plus three equals six

Sample Output:

3
[:|||:]

Note:

Let us remind you that the number of inversions is the number of pairs of words that follow in the permutation not in their original order. Thus, for example, if the original problem is "add two numbers", then permutation "numbers add two" contains two inversions — pairs of words "numbers" and "add", "numbers" and "two".

Sequence b₁,  b₂,  ...,  b_k is a subsequence of sequence a₁, a₂,  ...,  a_n if there exists such a set of indices 1 ≤ i₁ <  i₂ < ...   < i_k ≤ n that a_ij  =  b_j (in other words, if sequence b can be obtained from a by deleting some of its elements).

In the first test case the first problem contains the "find the palindrome next" permutation as a subsequence, in which the number of inversions equals 1 (words "palindrome" and "next").

In the second test case there is no problem that contains a permutation of words from Lesha's problem as a subsequence.