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

public class Triaining2020 {

    public static Scanner in = new Scanner(System.in);

    public static boolean ok(Text[] txt) {
        boolean ans = true;
        for (int i = 0; i < txt.length; i++) {
            String cur = txt[i].value;
            for (int j = i + 1; j < txt.length; j++) {
                if (!txt[j].value.contains(cur)) {
                    ans = false;
                    break;
                }
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        int n = in.nextInt();
        Text[] txt = new Text[n];
        for (int i = 0; i < n; i++) {
            String cur = in.next();
            txt[i] = new Text(cur, cur.length());
        }
        Arrays.sort(txt);

        if (ok(txt)) {
            System.out.println("YES");
            for (Text val : txt) {
                System.out.println(val.value);
            }
        } else {
            System.out.println("NO");
        }
    }

    public static class Text implements Comparable<Text> {

        String value = "";
        int length = 0;

        public Text(String a, int b) {
            length = b;
            value = a;
        }

        @Override
        public int compareTo(Text t) {
            return this.length - t.length;
        }

    }
}
