A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.

You are given a set of strings. A string (not necessarily from this set) is called good if all elements of the set are the most frequent substrings of this string. Restore the non-empty good string with minimum length. If several such strings exist, restore lexicographically minimum string. If there are no good strings, print "NO" (without quotes).

A substring of a string is a contiguous subsequence of letters in the string. For example, "ab", "c", "abc" are substrings of string "abc", while "ac" is not a substring of that string.

The number of occurrences of a substring in a string is the number of starting positions in the string where the substring occurs. These occurrences could overlap.

String a is lexicographically smaller than string b, if a is a prefix of b, or a has a smaller letter at the first position where a and b differ.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of strings in the set.

Each of the next n lines contains a non-empty string consisting of lowercase English letters. It is guaranteed that the strings are distinct.

The total length of the strings doesn't exceed 105.

Output

Print the non-empty good string with minimum length. If several good strings exist, print lexicographically minimum among them. Print "NO" (without quotes) if there are no good strings.

Examples

Input

4
mail
ai
lru
cf


Output

cfmailru


Input

3
kek
preceq
cheburek


Output

NO

Note

One can show that in the first sample only two good strings with minimum length exist: "cfmailru" and "mailrucf". The first string is lexicographically minimum.
n = int(input())

wrong_str = False

strings = []
sets = []
for _ in range(n):
    new_string = input()
    new_string_set = set(new_string)
    if len(new_string) != len(new_string_set):
        wrong_str = True
        break

    strings.append(new_string)
    sets.append(new_string_set)

if wrong_str:
    print("NO")
    exit(0)


connections = []
for _ in range(n):
    connections.append((-1,-1))

changed = True

while changed:

    changed = False

    for i in range(len(strings)):

        if strings[i] == None:
            continue

        for j in range(i + 1, len(strings)):

            if strings[j] == None:
                continue

            if len(set(strings[i]).intersection(set(strings[j]))) == 0:
                continue

            a = strings[i]
            b = strings[j]

            #print(a, b)

            if b in a:
                strings[j] = None
                changed = True
            elif a in b:
                strings[i] = b
                strings[j] = None
                changed = True
            else:

                is_ok = False

                start_index = a.find(b[0])
                if start_index != -1 and a[start_index:] in b:
                    strings[i] += strings[j][len(a) - start_index:]
                    strings[j] = None
                    is_ok = True
                    changed = True

                if not is_ok:
                    start_index = b.find(a[0])
                    if start_index != -1 and  b[start_index:] in a:
                        strings[i] = strings[j] + strings[i][len(b) - start_index:]
                        strings[j] = None
                        is_ok = True
                        changed = True

                if not is_ok:
                    print("NO")
                    exit(0)




        if wrong_str:
            print("NO")
            exit(0)

    strings = [x for x in strings if x is not None]

whole_str = "".join(strings)

if len(whole_str) != len(set(whole_str)):
    print("NO")
    exit(0)

print("".join(sorted(strings)))



