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 Main 
{
	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		
		sc.nextLine();
		
		StrOb[] arr = new StrOb[n];
		for(int i = 0; i<n; i++)
		{
			StrOb object = new StrOb(sc.next());
			arr[i] = object;
		}
		Arrays.sort(arr, new MyComparator());
		
		int j; 
		for(j=1; j<n; j++)
		{
			if(arr[j].len == arr[j-1].len && !arr[j].str.equals(arr[j-1].str))
			{
				System.out.println("NO");
				return;
			}
			else
			{
				if(isSubstring(arr[j-1].str, arr[j].str)==-1)
				{
					
					System.out.println("NO");
					return;
				}
			}
		}
		if(j == n)
		{
			System.out.println("YES");
			print(arr);
			return;
		}
	}
	
	static void print(StrOb[] arr)
	{
		for(int i =0; i<arr.length; i++)
			System.out.println(arr[i].str);
	}
	
	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;
    }
}

class MyComparator implements Comparator<StrOb>
{
	public int compare(StrOb o1, StrOb o2)
	{
		return o1.len - o2.len;
	}
}

class StrOb
{
	int len;
	String str;
	
	StrOb(String str)
	{
		this.str = str;
		len = str.length();
	}
}

