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

public class R486B {
	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		int n=scan.nextInt();
		HashMap<Integer,String> h=new HashMap<>();
		for(int i=0;i<n;i++) {
			h.put(i,scan.next());
		}
		ArrayList<Integer>[] a=new ArrayList[n];
		for(int i=0;i<n;i++) a[i]=new ArrayList<Integer>();
		int[] deg=new int[n];
		
		for(int i=0;i<n;i++) {
			for(int j=i+1;j<n;j++) {
				String s1=h.get(i), s2=h.get(j);
				if(s1.contains(s2)) {
					a[j].add(i);
					deg[i]++;
				}
				else if(s2.contains(s1)) {
					a[i].add(j);
					deg[j]++;
				}
			}
		}
		//System.out.println(h);
		//System.out.println(Arrays.toString(a));
		//System.out.println(Arrays.toString(deg));
		ArrayDeque<Integer> q=new ArrayDeque<>();
		
		for(int i=0;i<n;i++) if(deg[i]==0) q.offer(i);
		
		ArrayList<String> ans=new ArrayList<>();
		
		while(!q.isEmpty()) {
			//System.out.println(q);
			int u=q.poll();
			ans.add(h.get(u));
			for(int i:a[u]) {
				deg[i]--;
				if(deg[i]==0) q.offer(i);
			}
			//System.out.println(Arrays.toString(deg));
		}
		if(ans.size()!=n) {
			System.out.println("NO");
			return;
		}
		for(int i=0;i<n-1;i++) {
			if(!ans.get(i+1).contains(ans.get(i))) {
				System.out.println("NO");
				return;
			}
		}
		System.out.println("YES");
		for(String s:ans) System.out.println(s);
	}
}