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

题意：新定义题，重新定义了字典序的概念（ 即 a不一定小于b），已的n个单词是按 新字典序 从小到大排序的，求重新定义字典序的字母顺序。如果先后有矛盾输出  “Impossible”。

思路：既然是求先后顺序的题，当然要用拓扑排序了。从第一个单词开始，根据字典序的定义规则，求每个小写字母的入度，以及连接情况，然后依次取较小得字母就行。

代码如下：

#include<cstdio>
#include<cstring>
char str[110][110],num[50];
int f[50],map[50][50],L[110];
void tp()  //拓扑排序的核心代码
{
    int p,flag,cns=0;
    for(int i=0; i<26; i++)
    {
        int flag=0;
        for(int j=0; j<26; j++)
        {
            if(!f[j])  //此时这个字母是最小的
            {
                p=j;
                flag=1;
                break;
            }
        }
        if(!flag) //没有可确定的字母，矛盾了
        {
            printf("Impossible\n");
            return;
        }
        f[p]--;
        num[cns++]=p+'a';
        for(int j=0; j<26; j++)
            if(map[p][j])
                f[j]--;    //与p为前端的入度-1
    }
    num[cns]=0;//加 ‘/0’
    puts(num);
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%s",str[i]);
        L[i]=strlen(str[i]); //求每个单词的长度，
    }
    int flag=0;
    for(int i=0; i<n; i++) //依次比较
    {
        for(int j=i+1; j<n; j++)
        {
            int l1=L[i];//直接用每个单词的长度，能节约很多时间
            int l2=L[j];
            int k,a=0;
            for(k=0; k<l1&&k<l2; k++) //最多比较到较短的单词结束
            {
                if(str[i][k]!=str[j][k])
                {
                    a=1;
                    if(!map[str[i][k]-'a'][str[j][k]-'a'])//没有出现过这两个字母的连接
                    {
                        map[str[i][k]-'a'][str[j][k]-'a']=1;
                        f[str[j][k]-'a']++;   //入度+1，相当于在它前面还有一个字母
                    }
                    break;
                }
            }
            if(!a)  //较短的单词结束也没有出现过不同的字母，说明较短的单词是另一个单词的前缀
            {
                if(k!=l1)  //如果较短的单词不是上面的那个，说明已经不符合字典序的定义了
                {
                    flag=1;
                    break;
                }
            }
        }
        if(flag)
            break;
    }
    if(flag)
        printf("Impossible\n");
    else
        tp();
}