Episode 1: Optical Character Recognition (well, not quite)

Luke Skywalker wants to break into Darth Vader's quarters on an Imperial Cruiser to steal his supply of nasal spray. This nasal spray is rumoured to alleviate his incessant wheezing, resulting in improved Stormtrooper discipline (because they won't be laughing at him so often), resulting in a much deadlier attack force. But alas, Luke is a wimp and so he sends R2D2 to do the dirty work. Unfortunately, Luke was not really a bright lad and didn't find out which room belonged to Vader; therefore R2D2 has to find the correct room based on the name that is printed on the door. However, the Empire is smarter than Luke (heck, Chewy is smarter than Luke) and has made life a little tough for the droid by not orienting all the letters correctly. For example, if the room belonged to VADER, any of the 5 letters could be rotated by some multiple of 90° and so, VADER could actually be printed on the door as .

Your job is equip R2D2 with the algorithm to recognize which door he should break into.

Input

You will be given the "shape" of the 5 letters that make up the name that R2D2 is going to look for as follows (each letter will be represented by a 7 x 7 grid):

Line 1: 1st letter
Line 2-8: The shape of the 1st letter
Line 9: 2nd letter
Line 10-16: The shape of the 2nd letter
Line 17: 3rd letter
Line 18-24: The shape of the 3rd letter
Line 25: 4th letter
Line 26-32: The shape of the 4th letter
Line 33: 5th letter
Line 34-40: The shape of the 5th letter

The next 21 lines will represent a 21line grid (width ≤ 150) which is the grid you have to scan to determine which letters are represented in the grid. Note that, in the grid, a letter can be the same size, twice as big or 3 times as big as the letter you are given. In addition, a letter can be rotated by some multiple of 90o. Letters will be separated by at least one empty column, ie. one column of nothing but the letter "o". Letters need not be the same size or rotation, and they don't need to occupy the same lines in the grid.

You will then be given more 21-line grids (same letters) that you have to decipher. The number of grids you get will be variable and you must keep expecting grids until you see the end of the file. Note that it is not necessary for the grid to contain any letters.

Output

You will output the word that is shown in each grid (a separate line for each grid). If any of the letters in the grid matches NONE of the 5 letters whose shape you have been given, then output only "NONE" (all capitals) for that grid. If there are no letters in the grid at all, then output "EMPTY".

Sample Input

```V
*ooooo*
*ooooo*
o*ooo*o
o*ooo*o
oo*o*oo
oo*o*oo
ooo*ooo
A
ooo*ooo
oo*o*oo
oo*o*oo
o*****o
o*ooo*o
*ooooo*
*ooooo*
```
. . . and so on (3 more letters will be given)
```**oooooooooo**oooooooooooooooooooooooooooo
**oooooooooo**oooooooooooooooooooooooooooo
**oooooooooo**oooooooooooooooooooooooooooo
**oooooooooo**oooooooooooooooooooooooooooo
oo**oooooo**ooooooooooooooo*oooooooooooooo
oo**oooooo**oooooooooooooo*o*ooooooooooooo
oo**********oooooooooooooo*o*ooooooooooooo
oo**********ooooooooooooo*ooo*oooooooooooo
oooo**oo**ooooooooooooooo*ooo*oooooooooooo
oooo**oo**oooooooooooooo*ooooo*ooooooooooo
oooo**oo**oooooooooooooo*ooooo*ooooooooooo
oooo**oo**oooooooooooooooooooooooooooooooo
oooooo**oooooooooooooooooooooooooooooooooo
oooooo**oooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooooooooo
```

Sample Output

```AV
```

Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M
Added: Sep 29, 2008

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3