As usual, Sereja has array *a*, its elements are integers: *a*[1], *a*[2], ..., *a*[*n*]. Let's introduce notation:

A swap operation is the following sequence of actions:
 -  choose two indexes *i*, *j* (*i* ≠ *j*); -  perform assignments *tmp* = *a*[*i*], *a*[*i*] = *a*[*j*], *a*[*j*] = *tmp*. 
What maximum value of function *m*(*a*) can Sereja get if he is allowed to perform at most *k* swap operations?
The first line contains two integers *n* and *k* (1 ≤ *n* ≤ 200; 1 ≤ *k* ≤ 10). The next line contains *n* integers *a*[1], *a*[2], ..., *a*[*n*] ( - 1000 ≤ *a*[*i*] ≤ 1000).
s=[[]]*7
s[0]="jolteon"
s[1]="flareon"
s[2]="espeon"
s[3]="umbreon"
s[4]="leafeon"
s[5]="glaceon"
s[6]="sylveon"
n=int(input())
ch=input()
il=0
ss=0
p=[[]]*7
o=0
while(o<7):
    p[o]=0
    o+=1
while(il<7):
    ss=0
    while(ss<len(s[il])):
        if(ch[ss]==s[il][ss]and len(ch)==len(s[il])):
            p[il]+=1
        ss+=1
    il+=1
i=0
ii=0
while(i<len(p)):
    if(p[i]==max(p)):
        ii=i
    i+=1
print(s[ii])
