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>
struct TNode {
  TNode* children[30];
  TNode() {
    for (long i = 0; i < 30; i++) children[i] = NULL;
  }
} * Root;
long n, i;
std::string s, result("zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz");
bool found = false;
void puts(std::string s, TNode* node) {
  if (node->children[s[0] - 'a'] == NULL) {
    node->children[s[0] - 'a'] = new TNode();
  }
  if (s.length() > 1) {
    puts(s.substr(1), node->children[s[0] - 'a']);
  }
}
bool gt(std::string s1, std::string s2) {
  if (s1.length() != s2.length()) {
    return s1.length() > s2.length();
  } else {
    return s1 > s2;
  }
}
void find(TNode* node, std::string s) {
  if (gt(s, result)) return;
  char i;
  for (i = 'a'; i <= 'z'; i++) {
    if (NULL == node->children[i - 'a']) {
      if (gt(result, s + i)) result = s + i;
      return;
    }
  }
  for (i = 'a'; i <= 'z'; i++) {
    if (found) return;
    find(node->children[i - 'a'], s + i);
  }
}
int main() {
  std::cin >> n;
  Root = new TNode();
  for (long i = 0; i < n; i++) {
    std::cin >> s;
    while (true) {
      puts(s, Root);
      if (s.length() == 1) break;
      s = s.substr(1);
    }
  }
  find(Root, "");
  std::cout << result << std::endl;
  return 0;
}
