#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n,m;
  cin >> n;
  string s[n];
  rep(i,n) cin >> s[i];
  cin >> m;
  string t[m];
  rep(i,m) cin >> t[i];
  int c[26],d[26];
  memset(c,-1,sizeof(c));
  memset(d,-1,sizeof(d));
  rep(i,n) {
    rep(j,s[i].size()-1) {
      c[s[i][j]-'A']=s[i][j+1]-'A';
      d[s[i][j+1]-'A']=s[i][j]-'A';
    }
  }
  rep(i,m) {
    rep(j,t[i].size()-1) {
      c[t[i][j]-'A']=t[i][j+1]-'A';
      d[t[i][j+1]-'A']=t[i][j]-'A';
    }
  }
  int f=0,k;
  rep(i,n) {
    rep(j,s[i].size()) {
      if(c[s[i][j]-'A']==-1) {
        if(f) {
          pr(-1);
          return;
        }
        f=1;
        k=s[i][j]-'A';
      }
    }
  }
  string r="";
  while(k!=-1) {
    r=(char)(k+'A')+r;
    k=d[k];
  }
  pr(r);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}