You are given n strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.

String a is a substring of string b if it is possible to choose several consecutive letters in b in such a way that they form a. For example, string "for" is contained as a substring in strings "codeforces", "for" and "therefore", but is not contained as a substring in strings "four", "fofo" and "rof".

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of strings.

The next n lines contain the given strings. The number of letters in each string is from 1 to 100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder n given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and n given strings in required order.

Examples

Input

5
a
aba
abacaba
ba
aba


Output

YES
a
ba
aba
aba
abacaba


Input

5
a
abacaba
ba
aba
abab


Output

NO


Input

3
qwerty
qwerty
qwerty


Output

YES
qwerty
qwerty
qwerty

Note

In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".
//package round486;

import java.io.*;
import java.util.ArrayList;

/**
 * round486
 * Short Description: (눈_눈)
 *
 * @author nikitos
 * @version 1.0.0
 */

public class B {

    public StreamTokenizer t;

    public int nextInt() throws IOException {
        t.nextToken();
        return (int) t.nval;
    }

    public String nextString() throws IOException {
        t.nextToken();
        return t.sval;
    }

    public void start() throws IOException {
        t = new StreamTokenizer( new BufferedReader(new InputStreamReader(System.in)));

        int n = nextInt();
        ArrayList<String> in = new ArrayList<>();
        in.add(nextString());

        for (int i = 1; i < n; i++) {
            String current = nextString();

            boolean bad = false;
            for (int j = 0; j < in.size(); j++) {
                if (current.length() < in.get(j).length()) {
                    in.add(j, current);
                    bad = true;
                    break;
                }
            }

            if (!bad) {
                in.add(current);
            }

        }
        
        boolean ex = false;
        for (int i = 1; i < n; i++) {
            if (!in.get(i).contains(in.get(i - 1))) {
                ex = true;
                break;
            }
        }

        if (ex) {
            System.out.println("NO");
        } else {
            System.out.println("YES");
            for (int i = 0; i < n; i++) {
                System.out.println(in.get(i));
            }
        }
    }

    public static void main(String[] args) throws IOException {
        new B().start();
    }

}
