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

public class TestClass {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		LinkedList<String> list = new LinkedList<String>();
		String first = br.readLine();
		list.add(first);
		boolean b = false;
		for(int i = 1; i < n; i++){
			String s = br.readLine();
			b = addString(s, list);
			if(!b){
				System.out.println("NO");
				return;
			}
		}
			System.out.println("YES");
			printList(list);
		
	}

	private static void printList(LinkedList<String> list) {
		Iterator<String> itr = list.iterator();
		while(itr.hasNext()){
			System.out.println(itr.next());
		}
		
	}

	private static boolean addString(String s, LinkedList<String> list) {
		int count = 0;
		boolean added = false;
		Iterator<String> itr = list.iterator();
		while(itr.hasNext()){
			String sa = itr.next();
			if(sa.contains(s)){
				list.add(count, s);
				added = true;
				break;
			}
			else if(s.contains(sa)){
				count++;
			}
			else{
				return false;
			}
		}
		
		if(!added){
			list.add(count, s);
		}
		return true;
	}
}
