A. Eevee

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Sylveon.

You know the length of the word in the crossword, and you already know some letters. Designers of the crossword made sure that the answer is unambiguous, so you can assume that exactly one pokemon out of the 8 that Eevee evolves into fits the length and the letters given. Your task is to find it.

Input

First line contains an integer n (6 ≤ n ≤ 8) – the length of the string.

Next line contains a string consisting of n characters, each of which is either a lower case english letter (indicating a known letter) or a dot character (indicating an empty cell in the crossword).

Output

Print a name of the pokemon that Eevee can evolve into that matches the pattern in the input. Use lower case letters only to print the name (in particular, do not capitalize the first letter).

Sample test(s)

input

7j......

output

jolteon

input

7...feon

output

leafeon

input

7.l.r.o.

output

flareon

Note

Here's a set of names in a form you can paste into your solution:

["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"]

{"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"}

解题说明：此题是找出符合条件的字符串，由于字符串数目有限，直接穷举即可。首先比较长度，然后比较每一位。

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstdlib>#include<cstring>using namespace std;int main(){int n,i,j,flag;char s[10],names[8][10]={"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"};scanf("%d%s",&n,s);for(i=0;i<8;i++){if(strlen(names[i])==n){flag=0;for(j=0;j<n;j++){if(s[j]!='.'&&s[j]!=names[i][j]){flag=1;break;}}if(!flag){printf("%s\n",names[i]);break;}}}return 0;}