Problem: Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: "Fox"). She heard a rumor: the authors list on the paper is always sorted in the lexicographical order. 

After checking some examples, she found out that sometimes it wasn't true. On some papers authors' names weren't sorted in lexicographical order in normal sense. But it was always true that after some modification of the order of letters in alphabet, the order of authors becomes lexicographical!

She wants to know, if there exists an order of letters in Latin alphabet such that the names on the paper she is submitting are following in the lexicographical order. If so, you should find out any such order.

Lexicographical order is defined in following way. When we compare s and t, first we find the leftmost position with differing characters: si ≠ ti. If there is no such position (i. e. s is a prefix of t or vice versa) the shortest string is less. Otherwise, we compare characters si and ti according to their order in alphabet.

Input

The first line contains an integer n (1 ≤ n ≤ 100): number of names.

Each of the following n lines contain one string namei (1 ≤ |namei| ≤ 100), the i-th name. Each name contains only lowercase Latin letters. All names are different.

Output

If there exists such order of letters that the given names are sorted lexicographically, output any such order as a permutation of characters 'a'–'z' (i. e. first output the first letter of the modified alphabet, then the second, and so on).

Otherwise output a single word "Impossible" (without quotes).

Examples

Input

3
rivest
shamir
adleman


Output

bcdefghijklmnopqrsatuvwxyz


Input

10
tourist
petr
wjmzbmr
yeputons
vepifanov
scottwu
oooooooooooooooo
subscriber
rowdark
tankengineer


Output

Impossible


Input

10
petr
egor
endagorion
feferivan
ilovetanyaromanova
kostka
dmitriyh
maratsnowbear
bredorjaguarturnik
cgyforever


Output

aghjlnopefikdmbcqrstuvwxyz


Input

7
car
care
careful
carefully
becarefuldontforgetsomething
otherwiseyouwillbehacked
goodluck


Output

acbdefhijklmnogpqrstuvwxyz

Solution (in JAVA):

Solution:
/*
 *
 * @author Mukesh Singh
 *
 */

import java.io.*;
import java.util.*;
import java.text.DecimalFormat;
@SuppressWarnings("unchecked")
public class AB
{	
	
	//solve test cases
	void solve() throws Exception 
	{
		int n = in.nextInt();
		String ar[] = new String[n];
		for(int i = 0 ; i < n ; i++)
			ar[i] = in.nextToken();
		if(n == 1)
		{
			char a= 'a';
			for(int i = 0 ;i < 26; i++)
			{
				a = (char)('a'+i) ;
				System.out.print(a);
			}
			System.out.println();
			return ;
		}
		int gr[][] = new int[26][26];
		for(int i = 1 ;i  < n ; i++)
		{
			int j = 0;
			int k = 0 ;
			while(j< ar[i-1].length() && k< ar[i].length()&&ar[i].charAt(k)==ar[i-1].charAt(j))
			{
				k++;
				j++;
			}
			//k and j have first different position
			if(j == ar[i-1].length())
				continue ;
			else if(k == ar[i].length())
			{
				System.out.println("Impossible");
				return  ;
			}
			else 
				gr[ar[i-1].charAt(j)-'a'][ar[i].charAt(k)-'a'] = 1;
		}
		/*for(int br[] : gr)
		{
			for(int a : br)
				System.out.print(a+" ");
			System.out.println();
		}
		//print topological ordering of nodes
			for(int k = 0 ; k < 26; k++)
			{
				if(detect(gr,k))
				{
					System.out.println("Impossible");
					return  ;
				}
			}*/
		 for (int k = 0; k < 26; ++k)
            for (int i = 0; i < 26; ++i)
                for (int j = 0; j < 26; ++j)
                	if(gr[i][k]==1 && gr[k][j]==1)
                		gr[i][j] = 1 ;
         for(int i = 0 ; i < 26 ; i++)
         	if(gr[i][i] == 1 )
         	{
         		System.out.println("Impossible");
				return  ;
         	}
		topological(gr);
	}
	//this function print topological sorted order of elements
	void topological(int ar[][])
	{
		int nodes = ar[0].length ;
		boolean visited[] = new boolean[nodes];
		int start[] = new int[nodes];
		int end[] = new int[nodes];
		int counter = 0 ;
		LinkedList<Integer> ls = new LinkedList<Integer>();
		Stack<Integer> st = new Stack<Integer>();
		for(int i= 0 ; i < nodes ; i++)
		{
			if(!visited[i])
			{
				st.push(i);
				visited[i] = true ;
				start[i] = ++counter ;
			outer: while(st.size() > 0)
				{
					int elem = st.peek();
					for(int j = 0 ; j < nodes ; j++)
					{
						if(!visited[j] && ar[elem][j]==1)
						{
							visited[j] = true ;
							start[j] = ++counter ;
							st.push(j);
							continue outer ;
						}
					}
					end[elem] = ++counter ;
					ls.addFirst(elem);
					st.pop();
				}
			}
		}
		for(int a : ls)
		{
			char ch = (char)('a'+a);
			System.out.print(ch);
		}
		System.out.println();
	}
	
	boolean detect( int A[][] ,int src )
	{
		Stack<Integer> stack = new Stack<Integer>();
		int nodes , i , j , k , elem;
		nodes = A[0].length ;
		int[] visited = new int[nodes];	
		stack.push(src);
		elem = src ;
		visited[elem] = 1;
		int state[] = new int[nodes];
		Arrays.fill(state,-1);
		//System.out.println("src "+src);
outer : while (!stack.isEmpty())
        {
            elem = stack.peek();			
			i = Math.max(0,state[elem]) ;
			//System.out.println("kkk");	
		    while (i <  nodes)
		    {
     	        if (A[elem][i] == 1 && visited[i] == 0)
		        {
		        	//System.out.println("push "+i);
                    stack.push(i);
                    visited[i] = 1;
                    state[elem] = ++i;
					continue outer;
                }
				else if (A[elem][i] == 1 && visited[i] == 1)
				{
					//System.out.println(elem+" "+i);
					return true ;
				}
                i++;
	    	}
			stack.pop();	
        }
		return false ;
	}

	//@ main function
	public static void main(String[] args) throws Exception 
	{
		new AB();
	}
	
	InputReader in;
	PrintStream out ;
	DecimalFormat df ;
	AB() 
	{
		try 
		{
			File defaultInput = new File("file.in");
			if (defaultInput.exists()) 
				in = new InputReader("file.in");
			else 
				in = new InputReader();
			defaultInput = new File("file.out");
			if (defaultInput.exists()) 
				out = new PrintStream(new FileOutputStream("file.out"));
			else
				out = new PrintStream(System.out);
			df = new DecimalFormat("######0.00");
			solve();
			out.close();
		} 
		catch (Exception e) 
		{
			e.printStackTrace();
			System.exit(261);
		}
	}
	
	class InputReader {
		BufferedReader reader;
		StringTokenizer tokenizer;
		
		InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
		}
		
		InputReader(String fileName) throws FileNotFoundException {
			reader = new BufferedReader(new FileReader(new File(fileName)));
		}
		
		String readLine() throws IOException {
			return reader.readLine();
		}
		
		String nextToken() throws IOException {
			while (tokenizer == null || !tokenizer.hasMoreTokens())
				tokenizer = new StringTokenizer(readLine());
			return tokenizer.nextToken();
		}
		
		boolean hasMoreTokens() throws IOException {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				String s = readLine();
				if (s == null)
					return false;
				tokenizer = new StringTokenizer(s);
			}
			return true;
		}
		
		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(nextToken());
		}
		
		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(nextToken());
		}
		
		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(nextToken());
		}
	}
}