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;
long long int i, j, k;
void solve() {
  long long int n;
  cin >> n;
  string s[n];
  for (i = 0; i < n; i++) {
    cin >> s[i];
  }
  bool flag = true;
  string r = "a";
  int x = 'a';
  char c = 'a';
  while (flag) {
    bool fl = true;
    for (i = 0; i < n; i++) {
      size_t found = s[i].find(r);
      if (found != string::npos) {
        fl = false;
        break;
      }
    }
    if (fl == true) {
      cout << r << '\n';
      flag = false;
      return;
    }
    if (c == 'z') {
      flag = false;
      break;
    }
    x++;
    c = x;
    r.pop_back();
    r.push_back(c);
  }
  r = "aa";
  x = 'a';
  int y = 'a';
  c = 'a';
  char d = 'a';
  flag = true;
  while (flag) {
    bool fl = true;
    for (i = 0; i < n; i++) {
      size_t found = s[i].find(r);
      if (found != string::npos) {
        fl = false;
        break;
      }
    }
    if (fl == true) {
      cout << r << '\n';
      flag = false;
      return;
    }
    if (r == "zz") {
      flag = false;
      break;
    }
    if (c == 'z') {
      x++;
      d = x;
      c = 'a';
      y = 'a';
      r.pop_back();
      r.pop_back();
      r.push_back(d);
      r.push_back(c);
    } else {
      y++;
      c = y;
      r.pop_back();
      r.push_back(c);
    }
  }
  return;
}
signed main() {
  solve();
  return 0;
}
