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.*;
import java.util.*;

public class Main {


    public static void main(String[] args) throws IOException {
//        out = new PrintWriter(new File("output.txt"));
//        br = new BufferedReader(new FileReader(new File("input.txt")));
        int jopa = 1;
        for (int NASRAL = 0; NASRAL < jopa; NASRAL++) {
            int n = nextInt();
            String[] str = new String[n];
            for (int i = 0; i < n; i++) {
                str[i] = next();
            }
            Arrays.sort(str, new Comparator<String>() {
                @Override
                public int compare(String o1, String o2) {
                    return Integer.compare(o1.length(), o2.length());
                }
            });
            boolean norm = true;
            for (int i = 1; i < n; i++) {
                if (!in(str[i - 1], str[i])) norm = false;
            }
            if (norm) {
                out.println("YES");
                for (int i = 0; i < n; i++) {
                    out.println(str[i]);
                }
            } else out.println("NO");

        }
        out.close();
    }

    static boolean in(String a, String b) {
        int n = a.length();
        int m = b.length();
        for (int j = 0; j < m; j++) {
            int ind_j = j;
            int cnt = 0;
            while (cnt != n && ind_j != m && a.charAt(cnt) == b.charAt(ind_j)) {
                ind_j++;
                cnt++;
            }
            if (cnt == n) return true;
        }
        return false;
    }

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(System.out);
    static StringTokenizer in = new StringTokenizer("");


    public static String next() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

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

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

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

class Point {
    int val;
    int ind;

    public Point(int val, int ind) {
        this.val = val;
        this.ind = ind;
    }
}