#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using llu = long long unsigned;

// メイン関数
int main() {
    int n;
    cin >> n;

    vector<string> s(n);
    for (int i=0; i<n; ++i) {
        string t;
        cin >> t;
        sort(t.begin(), t.end());
        s[i] = t;
    }

    vector<bool> isNg(n);
    for (int i=0; i<n; ++i) {
        for (int j=i+1; j<n; ++j) {
            if (s[i] == s[j]) {
                isNg[i] = true;
                isNg[j] = true;
            }
            else if (s[i].size() == s[j].size()) {
                map<char, int> tmp1, tmp2;
                for (int k=0; k<s[i].size(); ++k) {
                    tmp1[s[i][k]]++;
                }
                for (int k=0; k<s[j].size(); ++k) {
                    tmp2[s[j][k]]++;
                }
                int count = 0;
                for (char c='a'; c<='z'; ++c) {
                    if (tmp1[c] != tmp2[c]) { count++; }
                }
                if (count <= 2) {
                    isNg[i] = true;
                    isNg[j] = true;
                }
            }
        }
    }

    string ret = "-1";
    for (int i=0; i<n; ++i) {
        if (!isNg[i]) {
            ret = s[i] + 'a';
            break;
        }
    }

    cout << ret << endl; return 0;
}