N. First words
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Veronica learned to talk. For Igor and Ira, this is the great happiness and a whole event. Now Veronica knows only $$$n$$$ words; Igor and Ira wrote down each word in a notebook as a line consisting of small Latin letters.

Igor decided to keep Veronica's first monologue. To do this, Igor wrote down in a notebook the sounds in small Latin letters that Veronica pronounced. After recording, Igor decided to check the correctness of the received line $$$s$$$, whether this line was formed from words that Veronica knows.

Help Igor determine whether he has correctly written down Veronica's monologue in his notebook.

Input

In the first line is given the whole number $$$n$$$ $$$(1\leq n \leq 100)$$$ – the amount of words that Veronica knows.

Then there are $$$n$$$ lines consisting of words that Veronica knows.

Next is the line $$$s$$$ – Veronica's monologue, written in the notebook by Igor. All lines consist of small Latin letters.

It is guaranteed that sum of words' lengths that Veronica knows is not bigger than $$$10^5$$$.

It is guaranteed that the length of the line $$$s$$$ is not bigger than $$$10^5$$$.

Output

Output «YES» if Veronica could pronounce line $$$s$$$; if she could not pronounce line $$$s$$$ – output «NO».

Example
Input
4
bububu
mama
papa
matan
bububumatanbububumama
Output
YES