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.IOException;
import java.io.InputStreamReader;
import java.util.Comparator;

import static java.lang.Integer.parseInt;
import static java.util.Arrays.sort;

public class B_Substrings_Sort {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder ans = new StringBuilder();
        int n = parseInt(in.readLine());
        String[] st = new String[n];
        for (int i = 0; i < n; i++) {
            st[i] = in.readLine();
        }
        sort(st, Comparator.comparing((String stt) -> stt.length()));
        boolean ok = true;
        for (int i = 0; i < n - 1; i++) {
            if(!isSubstring(st[i],st[i + 1])){
                ok = false;
                break;
            }
        }
        if(ok){
            System.out.println("YES");
            for (int i = 0; i < n; i++) {
                System.out.println(st[i]);
            }
        }
        else
            System.out.println("NO");
    }

    static boolean isSubstring(String st,String st2){
        if(st2.indexOf(st) >= 0)
            return true;
        return false;
    }
}
