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;
import java.util.Collections;

public class SubstringsSort {
	public static void main(String[] args) throws IOException{
		BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
		String a=r.readLine();
		int b=Integer.parseInt(a); //decremented at the end for checking
		ArrayList<Info> info=new ArrayList<Info>();
		for(int z=0; z<b; z++){
			a=r.readLine();
			info.add(new Info(a));
		}
		for(int z=0; z<b; z++){
			int counter=0;
			String temp=info.get(z).s;
			for(int y=0; y<b; y++){
				String big=info.get(y).s;
				if(big.contains(temp))
					counter++;
			}
			info.get(z).setNum(counter);	
		}
		Collections.sort(info);
		boolean boo=true;
		int size=b;
		int index=0;
		while(index<size && boo && b>0){
			int s=info.get(index).num;
			boo=(s>=b);
			index++;
			b--;
		}
		if(boo){
			System.out.println("YES");
			for(Info inf: info)
				System.out.println(inf.s);
		}
		else
			System.out.println("NO");
	}
}

class Info implements Comparable	{
	public String s;
	public int num;
	public Info(String st){
		s=st;
	}
	
	public void setNum(int n){
		num=n;
	}

	public int compareTo(Object arg0) {
		Info other=(Info)arg0;
		if(num>other.num)
			return -1;
		if(num<other.num)
			return 1;
		return 0;
	}
	
	public String toString(){
		return s+" "+num;
	}
}