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 "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

//constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-9;

//int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;


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

	cin >> N;
	while (N) {
		vector<string>s(N);
		for (auto &i : s) {
			cin >> i;
			while (i.size() < 10) {
				i.push_back('z' + 1);
			}
		}
		vector<vector<int>>edge(27, vector<int>(27));
		for (int i = 0; i < 26; i++)edge[26][i] = 1;
		for (int i = 1; i < N; i++) {
			for (int j = 0; j < min(s[i - 1].size(), s[i].size()); j++) {
				if (s[i][j] != s[i - 1][j]) {
					edge[s[i - 1][j] - 'a'][s[i][j] - 'a'] = 1;
					break;
				}
			}
		}
		bool flag = true;
		for (int i = 0; i < 27; i++) {
			vector<int>to(27);
			queue<int>Q;
			Q.push(i);
			while (!Q.empty()) {
				int cn = Q.front();
				Q.pop();
				for (int j = 0; j < 27; j++) {
					if (edge[cn][j]) {
						if (!to[j]) {
							to[j] = 1;
							Q.push(j);
						}
					}
				}
			}
			if (to[i])flag = false;
		}
		if (flag)cout << "yes\n";
		else cout << "no\n";
		cin >> N;
	}

}
