#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 27;

int n, m, l, pos[N], cnt;
bool used[N];
string s, a, ans;
vector<string> sa, sb;

int main() {
    scanf("%d", &n);
    sa.reserve(n);
    l = 0;
    for (int i = 0; i < n; ++i) {
        cin >> s;
        sa.push_back(s);
        l += s.size();
    }
    scanf("%d", &m);
    sb.reserve(m);
    for (int i = 0; i < m; ++i) {
        cin >> s;
        sb.push_back(s);
    }

    sort(sa.begin(), sa.end());
    a.resize(l);
    cnt = 0;
    do {
        for (int i = 0, idx = 0; i < n; ++i) {
            for (int j = 0; j < sa[i].size(); ++j) {
                pos[sa[i][j] - 'A' + 1] = idx;
                a[idx++] = sa[i][j];
            }
        }

        memset(used, 0, sizeof(used));
        bool ok = true;
        for (int i = 0; i < m && ok; ++i) {
            for (int j = 0; j < sb[i].size(); ++j) {
                int v = pos[sb[i][0] - 'A' + 1] + j;
                if (v >= l || used[v]) {
                    ok = false;
                    break;
                }
                used[v] = true;
            }
        }
        if (ok) {
            ++cnt;
            ans = a;
            if (cnt > 1) break;
        }
    } while (next_permutation(sa.begin(), sa.end()));

    if (cnt == 1) puts(ans.c_str());
    else puts("-1");

    return 0;
}