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;

public class P486B {
    public static void main(String[] args) throws IOException {
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(isr);
        int cases = Integer.parseInt(br.readLine());
        String[] arr = new String[cases];
        for (int i = 0; i < cases; i++) 
            arr[i] = br.readLine();
        for (int i = 0; i < cases - 1; i++) {
            for (int j = 0; j < cases - i - 1; j++) {
                if (arr[j].length() > arr[j + 1].length()) {
                    String temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                } else if (arr[j].length() == arr[j + 1].length()) {
                    if (arr[j].contains(arr[j + 1])) {
                        String temp = arr[j];
                        arr[j] = arr[j + 1];
                        arr[j + 1] = temp;
                    }
                }
            }
        }
        boolean yes = true;
        for (int i = 0; i < arr.length - 1 && yes; i++) 
            if (!arr[i + 1].contains(arr[i]))
                yes = false;
        if (yes) {
            System.out.println("YES");
            for (String s : arr)
                System.out.println(s);
        } else
            System.out.println("NO");
         
    }
}
