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;
bool check(const string& s) {
  int chars[26] = {};
  for (char ch : s) {
    chars[ch - 'a']++;
    if (chars[ch - 'a'] > 1) return false;
  }
  return true;
}
bool has_similar(const string& s1, const string& s2) {
  int ch1[26] = {};
  int ch2[26] = {};
  for (char ch : s1) {
    ch1[ch - 'a']++;
  }
  for (char ch : s2) {
    ch2[ch - 'a']++;
  }
  for (int i = 0; i < 26; ++i)
    if (ch1[i] == 1 && ch1[i] == ch2[i]) return true;
  return false;
}
string can_append(const string& s2, const string& s1) {
  if (s2.find(s1[0]) != string::npos) {
    int ind = s2.find(s1[0]);
    int k = 0;
    for (int i = ind; i < (int)s2.size(); ++k, ++i) {
      if (s2[i] != s1[k]) return "";
    }
    return s2 + s1.substr(k);
  }
  return "";
}
string can_merge(const string& s1, const string& s2) {
  if (s1.find(s2) != string::npos) {
    return s1;
  } else if (s2.find(s1) != string::npos)
    return s2;
  else {
    string ans;
    ans = can_append(s1, s2);
    if (ans != "" && check(ans)) return ans;
    ans = can_append(s2, s1);
    if (check(ans)) return ans;
  }
  return "";
}
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<string> a;
  for (int i = 0; i < n; ++i) {
    string t;
    cin >> t;
    if (!check(t)) {
      cout << "NO\n";
      return 0;
    }
    a.push_back(t);
  }
  set<string> parts;
  parts.insert(a[0]);
  for (int i = 1; i < n; ++i) {
    bool has_sim = true;
    string next = a[i];
    vector<string> where;
    for (auto s : parts) {
      if (has_similar(next, s)) {
        has_sim = false;
        string m = can_merge(next, s);
        if (m == "") {
          cout << "NO\n";
          return 0;
        }
        where.push_back(s);
        next = m;
      }
    }
    if (!where.empty()) {
      for (auto s : where) parts.erase(s);
      parts.insert(next);
    }
    if (has_sim) parts.insert(a[i]);
  }
  for (auto s : parts) cout << s;
  cout << endl;
  return 0;
}
