Codeforces Round 290 (Div. 1)
A
Fox And Names
Codeforces
未评级
原题
←B →
翻译中…

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: $*s*_{*i*} ≠ *t*_{*i*}$. 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 $*s*_{*i*}$ and $*t*_{*i*}$ 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 $*name*_{*i*}$ ($1 ≤ |*name*_{*i*}| ≤ 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).

翻译中…

样例

Input #1
3
rivest
shamir
adleman
Output #1
bcdefghijklmnopqrsatuvwxyz
InputCopy OutputCopy
Input #2
10
tourist
petr
wjmzbmr
yeputons
vepifanov
scottwu
oooooooooooooooo
subscriber
rowdark
tankengineer
Output #2
Impossible
InputCopy OutputCopy
Input #3
10
petr
egor
endagorion
feferivan
ilovetanyaromanova
kostka
dmitriyh
maratsnowbear
bredorjaguarturnik
cgyforever
Output #3
aghjlnopefikdmbcqrstuvwxyz
InputCopy OutputCopy
Input #4
7
car
care
careful
carefully
becarefuldontforgetsomething
otherwiseyouwillbehacked
goodluck
Output #4
acbdefhijklmnogpqrstuvwxyz
InputCopy OutputCopy
题目信息
题号
512A
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。