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.
#include <bits/stdc++.h>
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(long long x) {
  if (x < 0) x = ~x + 1, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
  puts("");
}
long long ksm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
int g[26][26], a[26], in[26], out[26], vis[26];
string res;
int dfs(int u) {
  res = res + char(u + 'a');
  vis[u] = 1;
  for (int i = (0); i <= (25); i++)
    if (g[u][i]) {
      if (vis[i]) return 0;
      return dfs(i);
    }
  return 1;
}
int main() {
  int n = read();
  for (int i = (1); i <= (n); i++) {
    string s;
    cin >> s;
    for (int j = 0; j < s.size() - 1; j++) {
      g[s[j] - 'a'][s[j + 1] - 'a'] = 1;
    }
    if (s.size() == 1) a[s[0] - 'a'] = 1;
  }
  for (int i = (0); i <= (25); i++)
    for (int j = (0); j <= (25); j++)
      if (i == j && g[i][j]) {
        puts("NO");
        return 0;
      } else if (g[i][j])
        in[j]++, out[i]++;
  for (int i = (0); i <= (25); i++)
    if (in[i] > 1 || out[i] > 1) {
      puts("NO");
      return 0;
    }
  for (int i = (0); i <= (25); i++) {
    if (out[i] && !in[i]) {
      if (!dfs(i)) {
        puts("NO");
        return 0;
      }
    }
    if (a[i] && !out[i] && !in[i]) {
      res = res + char(i + 'a');
    }
  }
  for (int i = (0); i <= (25); i++) {
    if (in[i] && out[i] && !vis[i]) {
      puts("NO");
      return 0;
    }
  }
  cout << res << endl;
  return 0;
}
