Constellation Identification Problem

Given a matrix named UNIVERSE with 3 rows and 'N' columns, filled with characters {#, *, .}, where:

• '*' represents stars.
• '.' represents empty space.
• '#' represents a separator between galaxies.

Your task is to identify constellations shaped like vowels within this matrix. A constellation is a 3x3 matrix that forms the shape of a vowel. Multiple constellations can form a galaxy, but they will not overlap, and galaxies are separated by a column of '#'.

Input:

The first line of input contains an integer ‘T’ denoting the number of test cases.

The first line of each test case contains a single integer ‘N’ denoting the number of columns in the matrix.

The next 3 lines of each test case denote the matrix of size 3 rows and ‘N’ columns which denotes the stars and the galaxies. Each line contains ‘N’ space-separated characters from the set { ‘#’ , ’*’ , ’.’ }.

Output:

For each test case, print a string which contains the shape of vowels and the hashes.

Example:

Input:

2
5
* * * . *
* * * * *
* * * * *
7
* . * * * . *
* . * . * * *
* * * * * * *

Output:

EI
UO

Constraints:

• 1 <= T <= 50
• 3 <= N <= 10^5

Note: It is guaranteed that no two constellations are overlapping.