Problem: The committee members of the Kitoshima programming contest had decided to use crypto-graphic software for their secret communication. They had asked a company, Kodai Software, to develop cryptographic software that employed a cipher based on highly sophisticated mathematics.

According to reports on IT projects, many projects are not delivered on time, on budget, with required features and functions. This applied to this case. Kodai Software failed to implement the cipher by the appointed date of delivery, and asked to use a simpler version that employed a type of substitution cipher for the moment. The committee members got angry and strongly requested to deliver the full specification product, but they unwillingly decided to use this inferior product for the moment.

In what follows, we call the text before encryption, plaintext, and the text after encryption, ciphertext.

This simple cipher substitutes letters in the plaintext, and its substitution rule is specified with a set of pairs. A pair consists of two letters and is unordered, that is, the order of the letters in the pair does not matter. A pair (A, B) and a pair (B, A) have the same meaning. In one substitution rule, one letter can appear in at most one single pair. When a letter in a pair appears in the plaintext, the letter is replaced with the other letter in the pair. Letters not specified in any pairs are left as they are.

For example, by substituting the plaintext


ABCDEFGHIJKLMNOPQRSTUVWXYZ


with the substitution rule {(A, Z), (B, Y)} results in the following ciphertext.


ZYCDEFGHIJKLMNOPQRSTUVWXBA


This may be a big chance for us, because the substitution rule seems weak against cracking. We may be able to know communications between committee members. The mission here is to develop a deciphering program that finds the plaintext messages from given ciphertext messages.

A ciphertext message is composed of one or more ciphertext words. A ciphertext word is generated from a plaintext word with a substitution rule. You have a list of candidate words containing the words that can appear in the plaintext; no other words may appear. Some words in the list may not actually be used in the plaintext.

There always exists at least one sequence of candidate words from which the given ciphertext is obtained by some substitution rule. There may be cases where it is impossible to uniquely identify the plaintext from a given ciphertext and the list of candidate words.



Input

The input consists of multiple datasets, each of which contains a ciphertext message and a list of candidate words in the following format.

n
word1
.
.
.
wordn
sequence

n in the first line is a positive integer, representing the number of candidate words. Each of the next n lines represents one of the candidate words. The last line, sequence, is a sequence of one or more ciphertext words separated by a single space and terminated with a period.

You may assume the number of characters in each sequence is more than 1 and less than or equal to 80 including spaces and the period. The number of candidate words in the list, n, does not exceed 20. Only 26 uppercase letters, A to Z, are used in the words and the length of each word is from 1 to 20, inclusive.

A line of a single zero indicates the end of the input.

Output

For each dataset, your program should print the deciphered message in a line. Two adjacent words in an output line should be separated by a single space and the last word should be followed by a single period. When it is impossible to uniquely identify the plaintext, the output line should be a single hyphen followed by a single period.

Example

Input

4
A
AND
CAT
DOG
Z XUW ZVX Z YZT.
2
AZ
AY
ZA.
2
AA
BB
CC.
16
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
ABCDEFGHIJKLMNO
A B C D E F G H I J K L M N O ABCDEFGHIJKLMNO.
0


Output

A DOG AND A CAT.
AZ.
-.
A B C D E F G H I J K L M N O ABCDEFGHIJKLMNO.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

const int MAX_V = 40;
int V = MAX_V; //頂点数
vector<int> G[MAX_V]; //グラフ
int match[MAX_V]; // マッチングのペア
bool used[MAX_V]; // dfsで既に調べたか

void add_edge(int u, int v){
    G[u].push_back(v); G[v].push_back(u);
}

// 増加パスの探索
bool bp_dfs(int v){
    used[v]=true;
    rep(i,G[v].size()){
        int u=G[v][i], w=match[u];
        if(w<0 || (!used[w]&&bp_dfs(w))){
            match[v]=u; match[u]=v;
            return true;
        }
    }
    return false;
}

int bipartite_matching(){
    int ret=0;
    memset(match,-1,sizeof(match));
    rep(i,V){
        if(match[i]<0){
            memset(used,0,sizeof(used));
            if(bp_dfs(i)) ++ret;
        }
    }
    return ret;
}


vector<string> read_seq(){
    vector<string> ret;
    while(1){
        string s;
        cin >>s;

        if(s.back() == '.'){
            ret.pb(s.substr(0,s.size()-1));
            break;
        }
        ret.pb(s);
    }
    return ret;
}

const int A = 'Z'-'A'+1;

int n,m;
vector<string> w,s;
int ct;

vector<int> EN;
vector<bool> uw;
void dfs(int d, const vector<int> &en){
    if(d==m){
        ++ct;
        EN = en;
        return;
    }

    int sz = s[d].size();
    rep(i,n)if(!uw[i]){
        if(s[d].size() != w[i].size()) continue;

        bool valid = true;
        vector<int> t_en(en);
        rep(j,sz){
            int idw = w[i][j]-'A', ids = s[d][j]-'A';

            if(t_en[idw]==-1) t_en[idw] = ids;
            else{
                if(t_en[idw] != ids){
                    valid = false;
                    break;
                }
            }

            if(t_en[ids]==-1) t_en[ids] = idw;
            else{
                if(t_en[ids] != idw){
                    valid = false;
                    break;
                }
            }
        }
        if(!valid) continue;

        // check
        rep(j,MAX_V) G[j].clear();
        for(int ii=d+1; ii<m; ++ii)rep(jj,n){
            if(uw[jj] || jj==i) continue;
            if(s[ii].size() != w[jj].size()) continue;

            int LEN = s[ii].size();
            bool add = true;
            rep(k,LEN){
                if(t_en[w[jj][k]-'A'] != -1 && t_en[w[jj][k]-'A'] != s[ii][k]-'A') add = false;

                if(t_en[s[ii][k]-'A'] != -1 && t_en[s[ii][k]-'A'] != w[jj][k]-'A') add = false;

                if(!add) break;
            }

            if(add){
                // printf(" --- ADD %d %d\n",ii,jj);
                add_edge(ii,m+jj);
            }
        }

        int res = bipartite_matching();
        if(res == m-1-d){
            uw[i] = true;
            dfs(d+1,t_en);
            uw[i] = false;
            if(ct>1) return;
        }
    }
}

int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    while(cin >>n,n){
        w = vector<string>(n);
        rep(i,n) cin >>w[i];

        vector<string> seq = read_seq();

        s = seq;
        sort(all(s));
        s.erase(unique(all(s)), s.end());
        m = s.size();

        sort(all(s), [](const string &lh, const string &rh){ return (lh.size()==rh.size() ? (lh<rh) : (lh.size() > rh.size())); });

        uw = vector<bool>(n,false);
        ct = 0;
        dfs(0, vector<int>(A,-1));

        string ans = "";
        if(ct == 1){
            rep(i,seq.size()){
                if(i) ans += ' ';
                rep(j,seq[i].size()) ans += EN[seq[i][j]-'A']+'A';
            }
        }
        else ans = "-";

        ans += '.';
        cout << ans << endl;
    }
    return 0;
}