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.*;
import java.io.*;
public class SubstringsSort {

	public static void main(String[] args) throws Exception
	{
		//Scanner sc = new Scanner(new File("input.txt"));
		Scanner sc = new Scanner(System.in);
		int numRuns = Integer.parseInt(sc.nextLine());

		HashMap<Integer,StringNum> mapp = new HashMap<Integer,StringNum>();
		
		ArrayList<Integer> numKeys;
		
		searchBlock : 
		{

			for (int i = 0; i < numRuns; i++)
			{
				String line = sc.nextLine();

				if(!mapp.containsKey(line.length()))
					mapp.put(line.length(), new StringNum(line));
				
				else if(line.equals(mapp.get(line.length()).get()))
					mapp.get(line.length()).add();
				
				else
				{
					sc.close();
					System.out.println("NO");
					break searchBlock;
				}
			}

			sc.close();

			numKeys = new ArrayList<Integer>(mapp.keySet());
			Collections.sort(numKeys);

			for (int i = 0; i < numKeys.size()-1; i++)
			{
				if(! mapp.get(numKeys.get(i+1)).get().contains(mapp.get(numKeys.get(i)).get()) )
				{
					sc.close();
					System.out.println("NO");
					break searchBlock;
				}
			}

			System.out.println("YES");

			for (int i = 0; i < numKeys.size(); i++)
			{
				for (int j = 0; j < mapp.get(numKeys.get(i)).size(); j++)
				{
					System.out.println(mapp.get(numKeys.get(i)).get());
				}
			}

		}
		
	}
	
	
}

class StringNum
{
	private String str;
	private int num;
	
	StringNum(String s)
	{
		str = s;
		num = 1;
	}
	
	int size()
	{
		return num;
	}
	
	String get()
	{
		return str;
	}

	void add()
	{
		num++;
	}
	

	
}
