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

public class SubstringsSort1100 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int strings = in.nextInt();
        String[] array = new String[strings];
        int[] lengths = new int[strings];
        String largestString = "";
        for (int i = 0; i < strings; i++) {
            array[i] = in.next();
            lengths[i] = array[i].length();
            if (lengths[i] > largestString.length())
                largestString = array[i];
        }
        for (int i = 0; i < strings - 1; i++) {
            String onBlock = array[i];
            int smallestIndex = i;
            for (int j = i; j < strings; j++) {
                int JLength = array[j].length();
                if (JLength < array[smallestIndex].length())
                    smallestIndex = j;
            }
            array[i] = array[smallestIndex];
            array[smallestIndex] = onBlock;
        }
        boolean yes = true;
        for (int i = strings - 1; i > 0; i--) {
            if (!array[i].contains(array[i - 1])) {
                yes = false;
                out.print("NO");
                break;
            }
        }
        if (yes) {
            out.println("YES");
            for (int i = 0; i < strings; i++)
                out.println(array[i]);
        }
        out.close();
    }
}

