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 <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>
#include <fstream>

using namespace std;

struct before_main{before_main(){cin.tie(0); ios::sync_with_stdio(false);}} before_main;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

const char premark = 'a' - 1;

bool dfs(map<char, vector<char>>& G, vector<bool>& vis, char c) {
  for(auto& next: G[c]) {
    if(vis[next-'a']) return false;
    vis[next-'a'] = 1;
    if(!dfs(G, vis, next)) return false;
    vis[next-'a'] = 0;
  }
  return true;
}

void NG() {
  cout << "no" << endl;
}

int main() {

  for(int N; cin >> N && N;) {
    vector<string> v;
    int L = 1;
    rep(i, N) {
      string s; cin >> s;
      v.push_back(s);
      maximize(L, s.size());
    }
    rep(i, N) {
      v[i].resize(L, premark);
    }

    map<char, vector<char>> G;
    vector<bool> vis;

    rep(i, N-1) {
      REP(ni, i+1, N) {
        rep(j, L) {
          if(v[i][j] == v[ni][j] && v[i][j] == premark) break;
          if(v[i][j] == premark) break;
          if(v[ni][j] == premark) { NG(); goto ex; }
          if(v[i][j] == v[ni][j]) continue;
          G[v[i][j]].push_back(v[ni][j]);
          break;
        }
      }
    }

    REP(c, 'a','z'+1) if(!G[c].empty()) {
      sort(all(G[c]));
      G[c].erase(unique(all(G[c])), G[c].end());
    }

    REP(c, 'a','z'+1) {
      vis.clear(); vis.resize(26);
      vis[c-'a'] = 1;
      if(!dfs(G, vis, c)) { NG(); goto ex; }
    }

    cout << "yes" << endl;
    ex:;
  }
  
  return 0;
}