3
rjnflsbpxqivrcdjptj
vpojopbwbwbswdu
rydkiwnugwddcgcrng
 1
z
 30
b
u
p
n
f
m
t
i
j
k
p
h
a
c
w
z
z
p
t
d
o
w
u
q
l
y
i
o
a
u
 5
splt
ohqykk
xqpz
knojbur
pmfm
 2
hk
obsp
 5
zzxpfk
abcdefghijklmnopqrst
uvwxz
srgkjaskldfkln
vgnsdfdgfh
 2
rxscdzkkezud
wjehahqgouqvjienq
 5
ojdfhi
abcdefghijklmnopqrst
uvwxyz
ddfhdfhlasjt
qqq
 1
epkotfpkkrhhmuipmtdk
 10
kpmwcdoysw
gtpr
kuzoxmiixxbl
crgqtuo
jhbplhpklrgwnaugdf
zuxdaat
aycv
qwghrkqwkobrgevsjrk
tdxgc
lxyzgcmbzulcst
 5
dfijdfhi
abcdefghijklmnopqrst
uvwxy
kopsdfgiopjipw
jty
 2
xlaxwpjabtpwddc
txwdjmohrrszorrnomc
 1
a
 30
waiphwcqrrinr
o
qiqehzmgsjdoqd
kjexeesevrlowxhghq
judikhzkj
z
xo
lsdzypkfqro
sshgcxsky
gecntpcmoojfwp
svmytmcfhc
jrsrvsvbaiumlmkptn
s
wpcsovfjlyspviflk
ktvyzvddgllht
szahigtmklglrcocbo
znligfxkgxzkcfeu
liryvzmqwhr
xgrxkgiehxztv
etrjxdczppafly
jrdgajschhwsci
doxnxbjwptnimjmsuijx
zciwkbvrhgsjhrr
ehh
bzlnmd
xpbtbpftimnn
khbknqbvdkdd
mldj
skrvnyz
avptgpjmenfzfxwckmt
 30
e
x
itaubd
xcn
v
x
i
ci
aqs
zbi
q
cvdu
a
jos
qy
fjf
nayke
ge
s
q
qwad
gvz
o
ubn
nzoc
h
wnjwjrf
t
bq
bw
 1
b

a
 a
 e
 a
 a
 y
 b
 aa
 a
 ab
 z
 e
 b
 aa
 l
 a

#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l_temp, C[1000];
  char A[5], temp[21];
  vector<char> B, D;
  bool good;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%s", temp);
    l_temp = strlen(temp);
    for (int j = 0; j < l_temp; j++) B.push_back(temp[j]);
    B.push_back('#');
  }
  for (int i = 0; i < B.size(); i++) B[i] -= 'a';
  for (int i = 0; i < 26 && !good; i++) {
    D.clear();
    D.push_back(i);
    D.push_back('#');
    for (int p = 0; p < B.size(); p++) D.push_back(B[p]);
    C[0] = 0;
    int d = 0;
    for (int p = 1; p < D.size(); p++) {
      while (d > 0 && D[p] != D[d]) d = C[d - 1];
      if (D[p] == D[d]) d++;
      C[p] = d;
    }
    good = true;
    for (int p = 0; p < D.size(); p++)
      if (C[p] == 1) good = false;
    if (good) printf("%c\n", i + 'a');
  }
  for (int i = 0; i < 26 && !good; i++)
    for (int j = 0; j < 26 && !good; j++) {
      D.clear();
      D.push_back(i);
      D.push_back(j);
      D.push_back('#');
      for (int p = 0; p < B.size(); p++) D.push_back(B[p]);
      C[0] = 0;
      int d = 0;
      for (int p = 1; p < D.size(); p++) {
        while (d > 0 && D[p] != D[d]) d = C[d - 1];
        if (D[p] == D[d]) d++;
        C[p] = d;
      }
      good = true;
      for (int p = 0; p < D.size(); p++)
        if (C[p] == 2) good = false;
      if (good) printf("%c%c\n", i + 'a', j + 'a');
    }
  for (int i = 0; i < 26 && !good; i++)
    for (int j = 0; j < 26 && !good; j++)
      for (int k = 0; k < 26 && !good; k++) {
        D.clear();
        D.push_back(i);
        D.push_back(j);
        D.push_back(k);
        D.push_back('#');
        for (int p = 1; p < B.size(); p++) D.push_back(B[p]);
        C[0] = 0;
        int d = 0;
        for (int p = 0; p < D.size(); p++) {
          while (d > 0 && D[p] != D[d]) d = C[d - 1];
          if (D[p] == D[d]) d++;
          C[p] = d;
        }
        good = true;
        for (int p = 0; p < D.size(); p++)
          if (C[p] == 3) good = false;
        if (good) printf("%c%c%c\n", i + 'a', j + 'a', k + 'a');
      }
  return 0;
}
