Problem Statement

We found a dictionary of the Ancient Civilization Mayo (ACM) during excavation of the ruins. After analysis of the dictionary, we revealed they used a language that had not more than 26 letters. So one of us mapped each letter to a different English alphabet and typed all the words in the dictionary into a computer.

How the words are ordered in the dictionary, especially whether they are ordered lexicographically, is an interesting topic to many people. As a good programmer, you are requested to write a program to judge whether we can consider the words to be sorted in a lexicographical order.

Note: In a lexicographical order, a word always precedes other words it is a prefix of. For example, `ab` precedes `abc`, `abde`, and so on.



Input

The input consists of multiple datasets. Each dataset is formatted as follows:


n
string_1
...
string_n


Each dataset consists of n+1 lines. The first line of each dataset contains an integer that indicates n (1 \leq n \leq 500). The i-th line of the following n lines contains string_i, which consists of up to 10 English lowercase letters.

The end of the input is `0`, and this should not be processed.

Output

Print either `yes` or `no` in a line for each dataset, in the order of the input. If all words in the dataset can be considered to be ordered lexicographically, print `yes`. Otherwise, print `no`.

Example

Input

4
cba
cab
b
a
3
bca
ab
a
5
abc
acb
b
c
c
5
abc
acb
c
b
b
0


Output

yes
no
yes
no
#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max()/2;
const int MOD = 1e9+7;

using graph = vector<vector<int>>;
 
void dfs(int v, const graph& G, vector<int>& res, vector<int>& used) {
    used[v] = 1;
    for (auto to : G[v]) if (used[to] == 0) {
        dfs(to, G, res, used);
    }
    res.push_back(v);
    //cout<<v<<endl;
}
 
vector<int> topo_sort(const graph& G) {
    int V = G.size();
    vector<int> ide(V);
    for (int i = 0; i < V; i++) {
        for (auto to : G[i]) {
            //cout<<to<<endl;
            ide[to]++;
        }
    }
    vector<int> res;
    vector<int> used(V);
    for (int i = V - 1; i >= 0; i--) {
        if (ide[i] == 0) {
            //cout<<i<<endl;
            dfs(i, G, res, used);
        }
    }
    if(res.size()==0) res={-1};
    reverse(res.begin(), res.end());
    return res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    while(cin>>n,n){
        vector<string> s(n);
        for(int i=0;i<n;i++) cin>>s[i];
        if(n==1){
            cout<<"yes"<<endl;
            continue;
        }
        graph g(26);
        for(int i=1;i<n;i++){
            int len=min(s[i-1].length(),s[i].length());
            for(int j=0;j<len;j++){
                if(s[i-1][j]==s[i][j]) continue;
                int st=s[i-1][j]-'a',gt=s[i][j]-'a';
                g[st].push_back(gt);
                break;
            }
        }
        vector<int> res=topo_sort(g);
        //cout<<res.size()<<endl;
        if(res.size()!=26){
            cout<<"no"<<endl;
            continue;
        }
        map<int,int> mp;
        for(int i=0;i<26;i++){
            mp[res[i]]=i;
        }
        for(int i=0;i<n;i++){
            int len=s[i].length();
            for(int j=0;j<len;j++){
                int idx=s[i][j]-'a';
                idx=mp[idx];
                s[i][j]='a'+idx;
            }
        }
        bool f=true;
        for(int i=1;i<n;i++){
            if(s[i-1]>s[i]) f=false;
        }
        if(f) cout<<"yes"<<endl;
        else cout<<"no"<<endl;
    }
}
