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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Main {
	static class POINT implements Comparable<POINT>
	{
		String word;
		POINT(String word)
		{
			this.word=word;
		}
		@Override
		public int compareTo(POINT o) {
			if(word.length()>o.word.length())
				return 1;
			else if(word.length()==o.word.length())
				return word.compareTo(o.word);
			else
				return -1;
		}
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n=Integer.parseInt(br.readLine());
		ArrayList<POINT> list=new ArrayList<>();
		String max=br.readLine();
		int max_i=0;
		list.add(new POINT(max));
		for(int i=1; i<n; i++)
		{
			String temp=br.readLine();
			list.add(new POINT(temp));
			if(max.length()<temp.length())
			{
				max=temp;
				max_i=i;
			}
		}
		boolean done=true;

		list.sort(null);
		for(int i=0; i<n-1; i++)
		{

			if(list.get(i+1).word.contains(list.get(i).word))
				continue;
			else
			{
				done=false;
				break;
			}

		}

		if(done)
		{

			System.out.println("YES");
			for(int i=0; i<list.size(); i++)
				System.out.println(list.get(i).word);
		}
		else
			System.out.println("NO");

	}

}
