Migrated from Lutece 924 Alphabet Cookies

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Kitty likes cookies very much, and especially the alphabet cookies. Now, she get some alphabet cookies, and she wants to select some of them to spell some words.

The easy task for you, is to determine that whether she can spell the word she wants.

Input

The input contains several test cases.

Each test case contains an integer $N ( 0 < N \leq 100 )$ in a line.

And followed a line with $N$ capital letters, means the cookies she has.

Then the last line is a word with capital letters. And the word’s length isn’t more than $N$.

Output

One word for each test case. If she can spell the word by these letters, please output Yes, nor output No.

Samples

7
ARDHPYP
HAPPY
6
ARDHPY
HAPPY

Yes
No

Resources

2011 Heilongjiang collegiate programming contest