Fox And Names

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 tiaccording 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

题意：给出了一些排好顺序的字符串，但是这些字符串不一定是按照a->z这样的字典序排序的，而是按照字母顺序修改后的字典序排的，问这样的字母顺序是什么，如果不存在输出"Impossible"。

思路：这个题其实就是给26个英文字母排一下顺序，在这些字符串中的任意两个我们总会判断出来某个字母在某个字母前（当然一些特殊的例子除外），如果看成输赢问题的话，我们只要将所有字母输的次数统计出来然后拓扑排序就好啦，最后要注意一些特殊的情况，代码如下：

#include<stdio.h>
#include<string.h>
char str[110][110],num[50];
int f[50],book[50][50];
void topsort()
{
    int i,j,k,flag,len=0;
    for(i=0;i<26;i++)
    {
        int flag=0;
        for(j=0;j<26;j++)
        {
            if(f[j]==0)
            {
                k=j;
                flag=1;
                break;
            }
        }
        if(flag==0)      //肯定有一个一次都没有输过，那就是排到最后的字母
        {
            printf("Impossible\n");
            return ;
        }
        f[k]=-1;
        num[len++]=k+'a';
        for(int j=0;j<26;j++)
        {
            if(book[k][j])
                f[j]--;
        }
    }
  for(i=0;i<26;i++)
    printf("%c",num[i]);
    return ;
}
int main()
{
    int n,i,j,flag,h,s;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%s",str[i]);
    }
   flag=0;
    for(i=0;i<n;i++)
    {
        for(j=i+1;j<n;j++)
        {
            int l1=strlen(str[i]);
            int l2=strlen(str[j]);
            s=0;
            for(h=0;h<l1&&h<l2;h++)
            {
                if(str[i][h]!=str[j][h])
                {
                    s=1;
                    if(book[str[i][h]-'a'][str[j][h]-'a']==0)
                    {
                       book[str[i][h]-'a'][str[j][h]-'a']=1;
                        f[str[j][h]-'a']++; //这是记录字典序在前的字母输的次数
                    }
                    break;
                }
            }
            if(s==0)
            {
                if(h!=l1) //l2短，后者短，这是从大至小排的后者大不满足题意
                {
                    flag=1;
                    break;
                }
            }
        }
        if(flag)
            break;
    }
    if(flag)
        printf("Impossible\n");
    else
        topsort();
}