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

public class B
{
	static int isSubstring(String s1, String s2)
    {
        int M = s1.length();
        int N = s2.length();
     
        /* A loop to slide pat[] one by one */
        for (int i = 0; i <= N - M; i++)
        {
            int j;
     
            /* For current index i, check for
            pattern match */
            for (j = 0; j < M; j++)
                if (s2.charAt(i + j) != s1.charAt(j))
                    break;
     
            if (j == M)
                return i;
        }
     
        return -1;
    }
	
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
		String []s = new String[n];
		
		for(int i=0; i<n; i++)
			s[i] = sc.next();
		
		Arrays.sort(s, new Comparator<String>()
		{
		    @Override
		    public int compare(String s1, String s2)
		    {
		       if(s1.length() <= s2.length())
		    	   return -1;
		       else
		    	   return 1;
		    }
		});
		
		boolean flag = false;
		
		for(int i=0; i<n-1; i++)
		{
			int res = isSubstring(s[i], s[i+1]);
			
			if(res==-1)
			{
				flag = true;
				break;
			}
		}
		
		if(flag == true)
			System.out.println("NO");
		else
		{
			System.out.println("YES");
			
			for(int i=0; i<n; i++)
			{
				System.out.println(s[i]);
			}
		}
	}

}
