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".
//package codeforces.Round486;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class SubstringsSort {
    private static HashMap<Integer, ArrayList<String>> strings;
    private static ArrayList<String> sorted;

    private static boolean isSubstring(String a, String b) {
        for (int i = 0; a.length() + i <= b.length(); i++) {
            boolean substring = true;
            for (int j = 0; j < a.length(); j++) {
                if (!(a.charAt(j) == b.charAt(i+j))) substring = false;
            }
            if (substring) return true;
        }
        return false;
    }

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);

        strings = new HashMap<>(100);
        for (int i = 1; i <= 100; i++) strings.put(i, new ArrayList<>());

        int totalStrings = s.nextInt();
        sorted = new ArrayList<>(totalStrings);

        s.nextLine();
        for (int i = 0; i < totalStrings; i++) {
            String a = s.nextLine();
            strings.get(a.length()).add(a);
        }

        for (int i = 1; i <= 100; i++) {
            for (String a: strings.get(i)) sorted.add(a);
        }

        boolean substring = true;
        for (int i = 0; i < sorted.size() - 1; i++) {
            if (!isSubstring(sorted.get(i), sorted.get(i+1))) {
                substring = false;
                break;
            }
        }
        if (substring) {
            System.out.println("YES");
            for (String a: sorted) System.out.println(a);
        } else {
            System.out.println("NO");
        }
    }

}
