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>
const int MAXN = 100005;
using namespace std;
void goodbye() {
  cout << "NO\n";
  exit(EXIT_SUCCESS);
}
void check_occ(const string &s) {
  int occ[26] = {0};
  for (char c : s) {
    occ[c - 'a']++;
    if (occ[c - 'a'] > 1) {
      goodbye();
    }
  }
}
string merge(string s1, string s2) {
  int occ[26];
  fill(occ, occ + 26, -1);
  for (int i = 0; i < s1.size(); i++) {
    occ[s1[i] - 'a'] = i;
  }
  int pos1 = -1, pos2 = -1;
  for (int i = 0; i < s2.size(); i++) {
    if (occ[s2[i] - 'a'] != -1) {
      pos1 = occ[s2[i] - 'a'];
      pos2 = i;
      break;
    }
  }
  if (pos1 == -1) {
    return string();
  }
  if (pos1 < pos2) {
    swap(pos1, pos2);
    swap(s1, s2);
  }
  for (int i = 0; pos1 - i >= 0 && pos2 - i >= 0; i++) {
    if (s1[pos1 - i] != s2[pos2 - i]) {
      goodbye();
    }
  }
  for (int i = 0; pos1 + i < s1.size() && pos2 + i < s2.size(); i++) {
    if (s1[pos1 + i] != s2[pos2 + i]) {
      goodbye();
    }
  }
  string res = s1;
  if (s1.size() - pos1 >= s2.size() - pos2) {
    return s1;
  }
  for (int i = pos2 + (s1.size() - pos1); i < s2.size(); i++) {
    res.push_back(s2[i]);
  }
  check_occ(res);
  return res;
}
int N;
vector<string> vec;
void add(string s) {
  for (int i = 0; i < vec.size(); i++) {
    string m = merge(s, vec[i]);
    if (!m.empty()) {
      swap(vec[i], vec.back());
      vec.pop_back();
      add(m);
      return;
    }
  }
  vec.push_back(s);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0; i < N; i++) {
    string s;
    cin >> s;
    check_occ(s);
    add(s);
  }
  sort(vec.begin(), vec.end());
  for (string s : vec) {
    cout << s;
  }
  cout << '\n';
}
