Codeforce Round #208 Div.2 B

B. Dima and Text Messages

time limit per test2 seconds

memory limit per test256 megabytes

 

Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages to each other.

Dima and Inna are using a secret code in their text messages. When Dima wants to send Inna some sentence, he writes out all words, inserting a heart before each word and after the last word. A heart is a sequence of two characters: the "less" characters (<) and the digit three (3). After applying the code, a test message looks like that: <3word₁<3word₂<3 ... word_n<3.

Encoding doesn't end here. Then Dima inserts a random number of small English characters, digits, signs "more" and "less" into any places of the message.

Inna knows Dima perfectly well, so she knows what phrase Dima is going to send her beforehand. Inna has just got a text message. Help her find out if Dima encoded the message correctly. In other words, find out if a text message could have been received by encoding in the manner that is described above.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — the number of words in Dima's message. Next n lines contain non-empty words, one word per line. The words only consist of small English letters. The total length of all words doesn't exceed 10⁵.

The last line contains non-empty text message that Inna has got. The number of characters in the text message doesn't exceed 10⁵. A text message can contain only small English letters, digits and signs more and less.

Output

In a single line, print "yes" (without the quotes), if Dima decoded the text message correctly, and "no" (without the quotes) otherwise.

Sample test(s)

Input

3
i
love
you
<3i<3love<23you<3

Output

yes

Input

7
i
am
not
main
in
the
family
<3i<>3am<3the<3<main<3in<3the<3><3family<3

Output

no

Note

Please note that Dima got a good old kick in the pants for the second sample from the statement.

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1000005
#define mod 1000000007
#define ll long long
#define INF 0x7fffffff
int n, m;
char s[maxn];
char str[maxn];
int main(){
    int cas = 1;
    int t;
    /*scanf("%d", &t);
    while (t--){
        
    }*/
    while (~scanf("%d", &n)){
        m = 0;
        s[0] = '<';s[1] = '3';
        for (int i = 0; i < n; i++){
            scanf("%s", s + m+2);
            while (s[m] != '\0')m++;
            s[m] = '<'; s[m + 1] = '3';
        }
        int k=0;
        scanf("%s", str);
        m=max(strlen(str),strlen(s));
        for (int i = 0; i < m&&i+k<strlen(str);)if (str[i + k] != s[i])k++; else i++;
        if (k==strlen(str)-strlen(s))printf("yes\n");
        else printf("no\n");
    }
    return 0;
}