#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int nx[26], bk[26], app[26], used[26], vis[26];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fill(nx, nx + 26, -1);
  fill(bk, bk + 26, -1);
  cin >> n;
  while (n--) {
    cin >> s;
    for (int i = 0; i < s.size() - 1; i++) {
      int x = s[i] - 'a', y = s[i + 1] - 'a';
      vis[x] = true;
      if ((nx[x] != y && nx[x] != -1) || (x != bk[y] && bk[y] != -1)) {
        cout << "NO";
        return 0;
      } else {
        nx[s[i] - 'a'] = s[i + 1] - 'a';
        bk[s[i + 1] - 'a'] = s[i] - 'a';
      }
    }
    vis[s.back() - 'a'] = true;
    if (s.size() == 1 && !app[s[0] - 'a'])
      app[s[0] - 'a'] = 1;
    else if (s.size() == 1) {
      cout << "NO";
      return 0;
    }
  }
  vector<string> res;
  bool flag = false;
  for (int i = 0; i < 26; i++) {
    string x;
    if (bk[i] == -1 && nx[i] != -1) {
      flag = true;
      int c = i;
      do {
        x.push_back(c + 'a');
        used[c] = 1;
        c = nx[c];
      } while (c != -1);
    } else if (app[i] && bk[i] == -1 && nx[i] == -1) {
      used[i] = true;
      flag = true;
      x.push_back(i + 'a');
    }
    res.push_back(x);
  }
  for (int i = 0; i < 26; i++)
    if (!used[i] && vis[i]) {
      cout << "NO";
      return 0;
    }
  if (!flag) {
    cout << "NO";
    return 0;
  }
  sort(res.begin(), res.end());
  for (string x : res) cout << x;
}
