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



public class Solution{ 
	
 public static void main(String[] args) { 
     
     Scanner in = new Scanner(System.in);
     
     
	 int n,i,j;
	 boolean answer=true;
	 Word[] w;
	 
	 n=Integer.parseInt(in.next());
	 w=new Word[n];
	 
	 for(i=0;i<n;i++){
		 w[i]=new Word(in.next());
	 }
	 
	 Arrays.sort(w);
	 
	 for(i=0;i<n-1;i++){
		 boolean temp=false;
		 for(j=0;j<=w[i+1].l-w[i].l;j++){
			 if((w[i].s).equals((w[i+1].s).substring(j, j+w[i].l)) ){
				 temp=true;
			 }
		 }
		 
		 if(temp==false){
			 answer=false;
			 break;
		 }
		
	 }
	 
	 if(answer==false){
		 System.out.println("NO");
	 }
	 else{
		 System.out.println("YES");
		 for(i=0;i<n;i++)System.out.println(w[i].s);
	 }
	 
	 
 }
     
}

class Word implements Comparable<Word>{
	String s;
	int l;
	
	Word(String input){
		this.s=input;
		this.l=input.length();
	}
	
	public int compareTo(Word w){
		return this.l-w.l;
	}
}
 