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>
using namespace std;
const long long mod = 1e9 + 7, siz = 1e6 + 5;
long long t, n, m, k, in[30], out[30], a[siz];
bool deal[30], vis[30], taken[siz], edg[30][30];
vector<long long> g[30];
string ans;
void go(long long u) {
  if (!taken[u]) ans += 'a' + u;
  vis[u] = 1;
  taken[u] = 1;
  deal[u] = 0;
  for (auto x : g[u]) {
    if (vis[x]) {
      cout << "NO\n";
      exit(0);
    }
    go(x);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  vector<long long> st;
  for (long long i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (long long j = 0; j + 1 < s.size(); j++) {
      long long x = s[j] - 'a', y = s[j + 1] - 'a';
      if (!edg[x][y]) {
        edg[x][y] = 1;
        in[y]++;
        out[x]++;
        g[x].push_back(y);
      }
      if (in[y] > 1 or out[x] > 1) return cout << "NO\n", 0;
    }
    st.push_back(s[0] - 'a');
  }
  sort(st.begin(), st.end());
  for (auto x : st) deal[x] = 1;
  for (auto x : st) {
    if (in[x] != 0) continue;
    memset(vis, 0, sizeof vis);
    go(x);
  }
  for (auto x : st)
    if (deal[x]) return cout << "NO\n", 0;
  cout << ans << endl;
}
