I. Inspecting Spells
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the mystical realm of Lexicovia, a land where magic weaves through words and letters with the power to manifest the deepest desires, a group of friends skilled in the art of Spellcraft gather. These friends, known throughout the land for their wisdom and camaraderie, possess a unique collection of enchanted words—each a spell in its own right. As the annual Festival of the Arcane Words approaches, they embark on a quest to combine their spells in a way that summons a specific magical effect, encapsulated in a secret word known only to them. This year, the word they seek to manifest is a symbol of their enduring bond, a testament to the magic of friendship that has kept them united through every trial.

Your task is to assist this circle of friends in determining whether they can arrange their collection of enchanted words in such a manner that, when combined without altering the sequence of letters within each word, they can create a magical phrase that contains a specific secret word $$$S$$$ as a substring. The magical essence of their spells allows for the words to be reordered but forbids any alteration to the letters within each word, preserving the spell's integrity.

Input

The first line contains an integer $$$N$$$ ($$$1 \leq N \leq 10^3$$$), the number of enchanted words in the friends' collection.

Each of the next $$$N$$$ lines contains a string representing an enchanted word. Each word consists of lowercase English letters, and the total length of all words combined will not exceed $$$10^6$$$.

The following line presents the secret word $$$S$$$, a string of lowercase English, the length of the word will not exceed 1000 characters.

Output

Print "YES" if the friends can arrange their enchanted words in such a manner that the resulting magical phrase contains the secret word $$$S$$$ as a substring. Otherwise, print "NO".

Examples
Input
2
aho
la
holala
Output
YES
Input
4
la
tam
mas
ter
tamas
Output
NO