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

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String[] strings = new String[n];

        for (int i = 0; i < n; i++) {
            strings[i] = scanner.next();
        }

        Arrays.sort(strings, new Comparator<String>() {

            public int compare(String o1, String o2) {
                if (o2.contains(o1)){
                    if (o1.contains(o2))
                        return 0;
                    else
                        return 1;
                }
                else if (o1.contains(o2))
                    return -1;
                else
                    return 0;
            }
        });
        boolean flag = true;
        for (int i = n-1; i >= 0; i--) {
            for (int j = n-1; j > i; j--)
                if (!strings[i].contains(strings[j]))
                    flag = false;
        }

        if (!flag) {
            System.out.println("NO");
        } else {
            System.out.println("YES");
            for (int i = n-1; i >= 0; i--)
                System.out.println(strings[i]);
        }
    }
}
