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;
map<string, bool> substr;
int main() {
  int i, n, l, j;
  char strs[31][30], str[30];
  string test;
  scanf("%d", &n);
  while (n--) {
    scanf("%s", str);
    l = strlen(str);
    for (i = 0; i < l; i++) {
      for (j = 0; j <= i; j++) {
        strs[j][i - j] = str[i];
      }
    }
    for (i = 0; i < l; i++) {
      for (j = 0; j < (l - i); j++) {
        strs[i][l - i - j] = '\0';
        test.assign(strs[i]);
        substr[test] = 1;
      }
    }
  }
  substr.size();
  char startstr[10000];
  startstr[0] = '\0';
  int pos = -1;
  l = 0;
  char ch[2];
  ch[0] = 'a';
  ch[1] = '\0';
  while (1) {
    if (pos == -1) {
      l += 1;
      strcat(startstr, ch);
      pos = l - 1;
    } else if (startstr[pos] == 'z') {
      while (pos != -1 && startstr[pos] == 'z') {
        startstr[pos] = 'a';
        pos -= 1;
      }
      if (pos == -1) {
        l += 1;
        strcat(startstr, ch);
        pos = l - 1;
      } else {
        startstr[pos] += 1;
        pos = l - 1;
      }
    } else {
      startstr[pos] += 1;
      test.assign(startstr);
    }
    test.assign(startstr);
    if (substr.find(test) == substr.end()) {
      cout << test << endl;
      return 0;
      break;
    }
  }
  return 0;
}
