D. That Tracks
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

While blasting for coal, Boomberg happened upon a tablet filled with mysterious markings that looked like dinosaur tracks. Luckily, you recognize that this text is written in an ancient dinosaur language known as Dinossian, so you pull out a translation from your pocket that you have kept for this very moment.

Translation from Dinossian to English.

It is now your job to translate the message on the tablet into English.

Your text written in Dinossian will consist of $$$2$$$ lines, each containing $$$2n$$$ characters, which will be one of '.', '<', 'V', '>', or '^', which will represent empty spaces, left prints, down prints, right prints, and up prints, respectively. When translated into English, the text can contain letters or digits.

Each letter written in Dino will take up a 2x2 grid, so every letter in Dinossian will be written from left to right, side by side, without spaces.

A 'single' character like B would look like:

$$$\gt$$$$$$.$$$
$$$.$$$$$$.$$$

A 'vertical' character like M would look like:

$$$\vee$$$$$$.$$$
$$$\wedge$$$$$$.$$$

And a 'horizontal' character like 6 would look like:

$$$\lt$$$$$$\vee$$$
$$$.$$$$$$.$$$
Input

The first line of input will contain $$$n$$$ ($$$1\le n\le 2\cdot 10^5$$$) — the number of characters to translate.

The next 2 lines each contain $$$2n$$$ characters, each of which will be one of '.', '<', 'V', '>', or '^' — representing the markings in Dinossian.

It is guaranteed that the input translates to a valid set of characters.

Output

Output $$$n$$$ characters in a single line, the text translated from Dinossian into English. Print your result in all uppercase.

Example
Input
9
<V^<V.V.<.<.V.^.>.
....^.>.>.>.>.^.^.
Output
65MILLION
Note

The first letter in Dinossian is the leftmost 2x2 grid:

$$$\lt$$$$$$\vee$$$
$$$.$$$$$$.$$$

which corresponds to a 6.

The second letter in Dinossian is the 2nd 2x2 grid from the left:

$$$\wedge$$$$$$\lt$$$
$$$.$$$$$$.$$$

which corresponds to a 5.

A similar process for every one of the 9 characters. The final translated text should read '65MILLION'.