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 T>
void inline maxi(T &a, const T &b) {
  a = max(a, b);
}
template <class T>
void inline mini(T &a, const T &b) {
  a = min(a, b);
}
void shownum(int n, int m, int W = 6) {
  for (int i = n; i <= m; ++i) {
    cout << setw(W) << i;
  }
  cout << endl;
}
template <class T>
void show(T &a, int n, int m, int W = 6) {
  for (int i = n; i <= m; ++i) {
    cout << setw(W) << a[i];
  }
  cout << endl;
}
template <class T>
void show(T &a, int W = 6) {
  for (int(u) = 0; (u) < int(a.size()); ++u) {
    cout << setw(W) << a[u];
  }
  cout << endl;
}
const int maxnum = int(400 * 30) + 10;
const int maxint = INT_MAX;
const int minint = INT_MIN;
char t[100];
int ord(char x) { return x - 'a'; }
int tree[maxnum][26];
bool find(string t) {
  int u = 0;
  for (int(i) = 0; (i) < int(t.length()); ++i) {
    int c = ord(t[i]);
    if (!tree[u][c])
      return false;
    else
      u = tree[u][c];
  }
  return true;
}
void mmain() {
  int n;
  scanf("%d", &n);
  memset(tree, 0, sizeof(tree));
  int len = 1;
  for (int(i) = 0; (i) < int(n); ++i) {
    scanf("%s", t);
    int l = strlen(t);
    for (int(j) = 0; (j) < int(l); ++j) {
      int u = 0;
      for (int k = j; k < l; ++k) {
        int c = ord(t[k]);
        if (!tree[u][c]) {
          tree[u][c] = len++;
        }
        u = tree[u][c];
      }
    }
  }
  queue<string> q;
  for (int(i) = 0; (i) < int(26); ++i) q.push(string() + char('a' + i));
  while (!q.empty()) {
    string node = q.front();
    q.pop();
    if (!find(node)) {
      cout << node << endl;
      break;
    }
    for (int(i) = 0; (i) < int(26); ++i) q.push(node + char('a' + i));
  }
}
int main() { mmain(); }
