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.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class Main {
    static boolean in(String search, String s) {
        char[] ss = s.toCharArray();
        for (int i = 0; i < s.length() - search.length() + 1; i++) {
            if (search.equals(new String(Arrays.copyOfRange(ss, i, i + search.length()))))
                return true;
        }
        return false;
    }

    public static void main(String[] args) throws Exception {
        Initialize();
        int n = nextInt();
        String[] a = new String[n];
        for (int i = 0; i < n; i++) {
            a[i] = next();
        }
        Arrays.sort(a, Comparator.comparingInt(String::length));
        for (int i = 1; i < n; i++) {
            if (!in(a[i - 1], a[i])){
                out.print("NO");
                out.close();
                return;
            }
        }
        out.println("YES");
        for (String s : a) {
            out.println(s);
        }
        out.close();
    }

    static BufferedReader scan;
    static PrintWriter out;
    static StringTokenizer st;

    static void Initialize() {
        scan = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
    }

    static void Initialize(String name1, String name2) throws Exception {
        scan = new BufferedReader(new FileReader(name1));
        out = new PrintWriter(name2);
    }

    static String next() throws Exception {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(scan.readLine());
        return st.nextToken();
    }

    static int nextInt() throws Exception {
        return Integer.parseInt(next());
    }

    static long nextLong() throws Exception {
        return Long.parseLong(next());
    }

    static double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
}