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: <3word1<3word2<3 ... wordn<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 ≤ 105) — 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 105. 

The last line contains non-empty text message that Inna has got. The number of characters in the text message doesn't exceed 105. 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.

Examples

Input

3
i
love
you
&lt;3i&lt;3love&lt;23you&lt;3


Output

yes


Input

7
i
am
not
main
in
the
family
&lt;3i&lt;&gt;3am&lt;3the&lt;3&lt;main&lt;3in&lt;3the&lt;3&gt;&lt;3family&lt;3


Output

no

Note

Please note that Dima got a good old kick in the pants for the second sample from the statement.
import java.text.DecimalFormat;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.MathContext;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Arrays.fill;
import static java.util.Collections.*;

public class Main {
    public static void main(String[] args) throws Exception {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        int[] dx = {1, 0, -1, 0, -1, -1, 1, 1},
                dy = {0, 1, 0, -1, -1, 1 - 1, 1};
        int MAX = (int) (1e5 + 10);

        // GCD && LCM
        long gcd(long a, long b) {
            return b == 0 ? a : gcd(b, a % b);
        }

        long lcm(long a, long b) {
            return a * (b / gcd(a, b));
        }

        // REverse a String
        String rev(String s) {
            return new StringBuilder(s).reverse().toString();
        }


        /*^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ SOLUTION IS RIGHT HERE^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
        public void solve(int testNumber, InputReader in, PrintWriter out) throws IOException {
        	int x = in.nextInt();
        	StringBuilder pattern = new StringBuilder("<3");
        	while(x-->0)
        	pattern.append(in.next()+"<3");
        	char[] p = pattern.toString().toCharArray();
        	char[] m = in.next().toCharArray();
        	int i = 0,j = 0;
        	while(i < p.length && j < m.length){
        		if(p[i] == m[j])
        		{
        			i++;
        			j++;
        		}
        		else
        			j++;
        	}
        	if(i>= p.length){
        		out.println("yes");
        		return;
        	}
        		out.println("no");
        }
        
        public int gcd(int x, int y){
        	while(y>0){
        		int xx = x;
        		x = y;
        		y = xx%y;
        	}
        	return x;
        }
    }
    static class pair implements Comparable<pair>{
        public Integer x,y,total;
        public pair(int x,int y,int z){
            this.x = x;
            this.y = y;
            this.total = z;
        }
        public pair(){x=0; y=0; total = x+y;}
        public int compareTo(pair that) {
            if(this.x != that.x)
                return this.x.compareTo(that.x);
            else
                return this.y.compareTo(that.y);
        }
    }
    /*^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^`````````````````````````^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
    static class InputReader {
        private byte[] buf = new byte[8000];
        private int index;
        private int total;
        private InputStream in;
        // BufferedReader br = new BufferedReader(new
        // InputStreamReader(System.in));

        public InputReader(InputStream stream) {
            in = stream;
        }

        public int scan() {
            if (total == -1)
                throw new InputMismatchException();
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (total <= 0)
                    return -1;
            }
            return buf[index++];
        }

        public long scanlong() {
            long integer = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                } else
                    throw new InputMismatchException();
            }
            return neg * integer;
        }

        private int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                } else
                    throw new InputMismatchException();
            }
            return neg * integer;
        }

        public double scandouble() {
            double doubll = 0;
            int n = scan();
            int neg = 1;
            while (isWhiteSpace(n))
                n = scan();
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n) && n != '.') {
                if (n >= '0' && n <= '9') {
                    doubll *= 10;
                    doubll += n - '0';
                    n = scan();
                }
            }
            if (n == '.') {
                n = scan();
                double temp = 1;
                while (!isWhiteSpace(n)) {
                    if (n >= '0' && n <= '9') {
                        temp /= 10;
                        doubll += (n - '0') * temp;
                        n = scan();
                    }
                }
            }
            return neg * doubll;
        }

        private float scanfloat() {
            float doubll = 0;
            int n = scan();
            int neg = 1;
            while (isWhiteSpace(n))
                n = scan();
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n) && n != '.') {
                if (n >= '0' && n <= '9') {
                    doubll *= 10;
                    doubll += n - '0';
                    n = scan();
                }
            }
            if (n == '.') {
                n = scan();
                double temp = 1;
                while (!isWhiteSpace(n)) {
                    if (n >= '0' && n <= '9') {
                        temp /= 10;
                        doubll += (n - '0') * temp;
                        n = scan();
                    }
                }
            }
            return neg * doubll;
        }

        public String scanstring() {
            StringBuilder sb = new StringBuilder();
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            while (!isWhiteSpace(n)) {
                sb.append((char) n);
                n = scan();
            }
            return sb.toString();
        }

        public String scan_nextLine() {
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(n);
                n = scan();
            } while (!isEndOfLine(n));
            return res.toString();
        }

        public boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1)
                return true;
            return false;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }
        /// Input module

        public int nextInt() {
            return scanInt();
        }

        public long nextLong() {
            return scanlong();
        }

        public double nextDouble() {
            return scandouble();
        }

        public float nextFloat() {
            return scanfloat();
        }

        public String next() {
            return scanstring();
        }

        public String nextLine() throws IOException {
            return scan_nextLine();
        }

        public int[] readintArray(int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        public Integer[] readIntegerArray(int size) {
            Integer[] array = new Integer[size];
            for (int i = 0; i < size; i++) {
                array[i] = nextInt();
            }
            return array;
        }
    }

} 