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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Comparator;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		
		int n = Integer.parseInt(br.readLine());
		
		String[] words = new String[n];
		
		for(int i=0; i<n; i++) {
			words[i] = br.readLine();	
		}
		
		SubStringComparator comp = new SubStringComparator();
		
		Arrays.sort(words, comp);
		
		if(comp.getsubString() == false) {
			System.out.println("NO");
		}else {
			System.out.println("YES");
			for(int j=0; j<words.length; j++) {
				System.out.println(words[j]);
			}
		}

	}
	
	
	public static class SubStringComparator implements Comparator<String>{
		
		boolean substring = true;
		
		@Override
		public int compare(String str1, String str2) {
			
			if(str2.contains(str1)){
				return -1;
			}else if(str1.contains(str2)) {
				return 1;
			}else {
				substring = false;
			}
			
			return 0;
		}
		
		boolean getsubString() {
			return substring;
		}
		
	}
}


