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 Main 
{ 
	static class FastReader 
	{ 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() 
		{ 
			br = new BufferedReader(new
					InputStreamReader(System.in)); 
		} 

		String next() 
		{ 
			while (st == null || !st.hasMoreElements()) 
			{ 
				try
				{ 
					st = new StringTokenizer(br.readLine()); 
				} 
				catch (IOException e) 
				{ 
					e.printStackTrace(); 
				} 
			} 
			return st.nextToken(); 
		} 

		int nextInt() 
		{ 
			return Integer.parseInt(next()); 
		} 

		long nextLong() 
		{ 
			return Long.parseLong(next()); 
		} 

		double nextDouble() 
		{ 
			return Double.parseDouble(next()); 
		} 

		String nextLine() 
		{ 
			String str = ""; 
			try
			{ 
				str = br.readLine(); 
			} 
			catch (IOException e) 
			{ 
				e.printStackTrace(); 
			} 
			return str; 
		} 

		int [] nextArr(int n) {
    		int [] a = new int[n];
    		for(int i=0; i<n ; i++) 
				a[i] = nextInt();
    		return a;
    	}
	} 

	public static void main(String[] args) throws java.lang.Exception
	{ 
		FastReader sc = new FastReader();
		int n = sc.nextInt(); 
		String s[] = new String[n];
		
		for(int i=0; i<n; i++){
		    s[i] = sc.nextLine();
		}
		
		Arrays.sort(s, new Comparator<String>() { 
            public int compare(String a, String b) 
            { 
                return a.length() - b.length(); 
            } 
        });
        
        StringBuilder st = new StringBuilder();
        boolean sol = true;
        for(int i=1; i<n; i++){
            if(s[i].contains(s[i-1])){
                st.append(s[i-1]+"\n");
            }else{
                sol = false;
                break;
            }
        }
		
		if(sol){
		    System.out.println("YES");
		    System.out.println(st+s[n-1]);
		}else{
		    System.out.println("NO");
		}
		
	} 
} 
