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;
int main() {
  int n;
  char M[31][31];
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> M[i];
  }
  for (int i = 97; i <= 122; i++) {
    bool f = true;
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < strlen(M[j]); k++) {
        if (int(M[j][k]) == i) f = false;
      }
    }
    if (f) {
      cout << char(i) << endl;
      return 0;
    }
  }
  for (int i = 97; i <= 122; i++) {
    for (int x = 97; x <= 122; x++) {
      bool f = true;
      for (int j = 0; j < n; j++) {
        for (int k = 0; k < strlen(M[j]) - 1; k++) {
          if (int(M[j][k]) == i && int(M[j][k + 1]) == x) f = false;
        }
      }
      if (f) {
        cout << char(i) << char(x) << endl;
        return 0;
      }
    }
  }
  for (int i = 97; i <= 122; i++) {
    for (int x = 97; x <= 122; x++) {
      for (int y = 97; y <= 122; y++) {
        bool f = true;
        for (int j = 0; j < n; j++) {
          for (int k = 0; k < strlen(M[j]) - 2; k++) {
            if (int(M[j][k]) == i && int(M[j][k + 1]) == x &&
                int(M[j][k + 2]) == y)
              f = false;
          }
        }
        if (f) {
          cout << char(i) << char(x) << char(y) << endl;
          return 0;
        }
      }
    }
  }
  for (int i = 97; i <= 122; i++) {
    for (int x = 97; x <= 122; x++) {
      for (int y = 97; y <= 122; y++) {
        for (int o = 97; o <= 122; o++) {
          bool f = true;
          for (int j = 0; j < n; j++) {
            for (int k = 0; k < strlen(M[j]) - 3; k++) {
              if (int(M[j][k]) == i && int(M[j][k + 1]) == x &&
                  int(M[j][k + 2]) == y && int(M[j][k + 3]) == o)
                f = false;
            }
          }
          if (f) {
            cout << char(i) << char(x) << char(y) << char(o) << endl;
            return 0;
          }
        }
      }
    }
  }
  return 0;
}
