Parrots

While flying around the world in their private plane, pps789 and cseteram lost an engine and crash landed on an unnamed island. Exploring it, they learned that the parrots living there imitate human speech remarkably well. The two split up to explore separately and agreed to use the parrots if they had to contact each other.

A month later pps789 found decisive evidence about the secret of the island. He wanted to share the discovery with cseteram, but it was far too long for a single parrot to memorize. So pps789 split the discovery across $N$ parrots and sent them flying to cseteram.

On the other side of the island, cseteram was startled when $N$ parrots arrived and each started talking. He realized that pps789 was sending a long message, but he wrote the words down in the order he heard them, and the order came out so tangled that the original text was lost. What he did work out, by watching the parrots, were a few rules.

1. Each parrot memorizes one sentence. A sentence is made of several words, and the parrot says those words in the memorized order.
2. After a parrot says a word and before it says the next one there is a short gap, and during that gap another parrot can cut in and say its own sentence.
3. While a parrot is in the middle of saying a word, no other parrot cuts in.
4. No word appears twice across all of the sentences the parrots say.

Each parrot says its memorized sentence to the end and then flies back to pps789, and cseteram writes down words until every parrot has left. You are given the sentence $S_i$ that pps789 gave to each parrot and the sentence $L$ that cseteram wrote down. Decide whether $L$ can come out under the rules above.

The first line contains the number of parrots $N$ ($1 \le N \le 100$).

Each of the next $N$ lines contains the sentence $S_i$ ($1 \le i \le N$) that one parrot says, one sentence per line. The words of a sentence are separated by a single space. Sentence $S_i$ has between 1 and 100 words, and each word consists of 1 to 32 lowercase English letters.

Line $N + 2$ contains the sentence $L$ that cseteram wrote down. $L$ has between 1 and 10000 words, and each word consists of 1 to 32 lowercase English letters.

Print Possible if the sentence $L$ can come out, and Impossible otherwise.