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;
vector<set<int>> g(26);
vector<set<int>> g_t(26);
vector<int> used(26);
string dfs(int v) {
  used[v] = 1;
  for (auto i = g[v].begin(); i != g[v].end(); i++) {
    int to = *i;
    if (!used[to])
      return string(1, char(v + 'a')) + dfs(to);
    else
      return "!";
  }
  return string(1, char(v + 'a'));
}
int main() {
  int n;
  cin >> n;
  set<int> us;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < s.size(); j++) us.insert(s[j]);
    for (int j = 0; j < s.size() - 1; j++) {
      int from = s[j] - 'a', to = s[j + 1] - 'a';
      g[from].insert(to);
      g_t[to].insert(from);
    }
  }
  bool f = true;
  set<string> block;
  for (int i = 0; i < 26; i++)
    if (g[i].size() > 1 || g_t[i].size() > 1) return cout << "NO", 0;
  for (int i = 0; i < 26; i++) {
    if (us.count(i + 'a') && !g_t[i].size()) {
      string str = dfs(i);
      if (str[str.size() - 1] == '!') return cout << "NO", 0;
      block.insert(str);
    }
  }
  set<char> used_let;
  for (auto i : block) {
    for (char x : i) used_let.insert(x);
  }
  for (auto x : us)
    if (!used_let.count(x)) return cout << "NO", 0;
  for (auto i : block) cout << i;
  return 0;
}
