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".
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Khater
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BSubstringsSort solver = new BSubstringsSort();
        solver.solve(1, in, out);
        out.close();
    }

    static class BSubstringsSort {
        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int t = 1;
            //  t = sc.nextInt();
            while (t-- > 0) {
                int n = sc.nextInt();
                String[] arr = new String[101];
                Arrays.fill(arr, "!");
                boolean f = true;
                ArrayList<String>[] ans = new ArrayList[101];
                for (int i = 0; i < 101; i++) ans[i] = new ArrayList<>();
                for (int i = 0; i < n; i++) {
                    String s = sc.nextLine();
                    int l = s.length();
                    if (arr[l].equals("!")) {
                        arr[l] = s;
                    } else {
                        f &= arr[l].equals(s);
                    }
                    ans[l].add(s);
                }
                //	pw.println(f);
                String last = "";
                for (int i = 0; i < 101; i++) {
                    if (!arr[i].equals("!"))
                        if (last.equals("")) {
                            last = arr[i];
                        } else {
                            boolean g = false;
                            int l = last.length();
                            for (int j = 0; j + l <= arr[i].length(); j++) {
                                g |= last.equals(arr[i].substring(j, j + l));
                            }
                            f &= g;
                            last = arr[i];
                        }
                }

                if (f) {
                    pw.println("YES");
                    for (int i = 0; i < 101; i++) {
                        for (String s : ans[i]) pw.println(s);
                    }
                } else {
                    pw.println("NO");
                }
            }

        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String nextLine() {
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }

    }
}

