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;
template <class A, class B>
A cvt(B x) {
  stringstream s;
  s << x;
  A r;
  s >> r;
  return r;
}
typedef vector<int> VI;
typedef vector<pair<int, int> > VII;
typedef vector<string> VS;
set<string> s;
string str, ans, tmp;
bool finds(int l, string tmp) {
  if (l == 0) {
    if (s.find(tmp) == s.end()) {
      ans = tmp;
      return true;
    }
    return false;
  }
  int m = tmp.size();
  tmp.push_back('a');
  for (int i = (int)0; i < (int)26; ++i) {
    tmp[m] = 'a' + i;
    if (finds(l - 1, tmp)) return true;
  }
  return false;
}
int main() {
  int n, l;
  scanf("%d", &n);
  for (int i = (int)0; i < (int)n; ++i) {
    cin >> str;
    for (int j = (int)0; j < (int)str.size(); ++j) {
      for (int k = (int)j; k < (int)str.size(); ++k) {
        tmp = "";
        for (int w = (int)j; w < (int)k + 1; ++w) {
          tmp.push_back(str[w]);
        }
        s.insert(tmp);
      }
    }
  }
  l = 1;
  tmp = "";
  while (true) {
    if (finds(l, tmp)) break;
    l++;
  }
  cout << ans << endl;
  return 0;
}
