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
#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll

void solve(){
	while (true){
		starter:;
		int n;
		cin >> n;
		if (n == 0) return;
		int dist[27][27] = {};
		vector<string> inputs;
		REP(i, n) {
			string s;
			cin >> s;
			inputs.push_back(s);
		}
		for (int i = 1; i < inputs.size(); ++i) {
			int ok = 0;
			REP(q, min(inputs[i-1].size(),inputs[i].size())) {
				if (inputs[i][q] != inputs[i - 1][q]) {
					dist[inputs[i - 1][q] - 'a'][inputs[i][q] - 'a'] = 1;
					ok = 1;
					break;
				}
			}
			if (ok == 0) {
				if (inputs[i - 1].length() > inputs[i].length()) {
					cout << "no" << endl;
					goto starter;
				}
			}
		}
		REP(t, 3) {
			REP(i, 26) {
				REP(q, 26) {
					REP(j, 26) {
						if(dist[i][j] != 0&&dist[j][q] != 0)
						dist[i][q] = max(dist[i][q], dist[i][j] + dist[j][q]);
					}
				}
			}
		}
		int copy_dist[27][27];
		REP(i, 27) {
			REP(q, 27) {
				copy_dist[i][q] = dist[i][q];
			}
		}
		REP(t, 3) {
			REP(i, 26) {
				REP(q, 26) {
					REP(j, 26) {
						if (dist[i][j] != 0 && dist[j][q] != 0)
							dist[i][q] = max(dist[i][q], dist[i][j] + dist[j][q]);
					}
				}
			}
		}
		int ok = 1;
		REP(i, 26) {
			REP(q, 26) {
				if (dist[i][q] != copy_dist[i][q]) ok = 0;
			}
		}
		string ans[2] = { "no","yes" };
		cout << ans[ok] << endl;
	}
}

#undef int

int main() {
	init();
	solve();
}
