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.*;
import java.util.*;
import java.math.*;
import static java.lang.System.out;

public class CF988B
{
    static public class Word implements Comparable<Word>
    {
        String word;
        
        public Word(String word)
        {
            this.word = word;
        }
        
        public int compareTo(Word other)
        {
            if(other.word.length() < word.length())
                return 1;
            else
                return -1;
        }
        
        public String toString()
        {
            return word;
        }
    }
    
    public static void main(String[] args) throws IOException
    {
        //BufferedReader f = new BufferedReader(new FileReader("/Users/spencersharp/Desktop/input.txt"));
        
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter writer = new PrintWriter(new BufferedOutputStream(System.out));
        
        String output = ""; //Write all output to this string

        //Code here
        int num = Integer.parseInt(f.readLine());
        ArrayList<Word> words = new ArrayList<Word>();
        for(int i = 0; i < num; i++)
        {
            words.add(new Word(f.readLine()));
        }
        Collections.sort(words);
        boolean works = true;
        for(int i = 0; i < num - 1; i++)
        {
            //out.println(words.get(i));
            if(!words.get(i+1).word.contains(words.get(i).word))
            {
                works = false;
            }
        }
        if(works)
        {
            output = "YES";
            for(int i = 0; i < num; i++)
            {
                output += "\n" + words.get(i);
            }
        }
        else
        {
            output = "NO";
        }
        
        
        //Code here

        //out.println(output);
        
        writer.println(output);
        writer.close();
        System.exit(0);
        
    }
}