Description

While Mr. Malnar was traveling by bus to Graz, he noticed that other passengers were looking at his phone and reading the messages he was sending to Patrik. Mr. Malnar decided to put an end to this. Therefore, together with Patrik, he developed a new way of encrypting their messages, which they call the VolksWagen cipher.

The received message can be imagined as a table of characters with $2$ rows and $n$ columns. Each letter spans all $2$ rows and several columns, and they are separated by spaces. The appearance of letters in the message can be seen in the sample test cases.

The letter $\texttt{v}$ is represented as follows:

$$\begin{aligned}&\texttt{\char092../}\\&\texttt{.\char092/.}\end{aligned}$$

The letter $\texttt{w}$ is represented as follows:

$$\begin{aligned}&\texttt{\char092../\char092../}\\&\texttt{.\char092/..\char092/}\end{aligned}$$

From now on, Patrik and Mr. Malnar will communicate exclusively using the letters $\texttt{v}$ and $\texttt{w}$. However, Mr. Malnar is having trouble reading these messages. He has asked you to help him decipher the message he received. Of course, he has not revealed to you how to decrypt their cipher.

Input Format

The first line contains a positive integer $N$ ($1 ≤ N ≤ 1000$), the number of columns in the message.

In the next $2$ rows, there are $N$ characters each, representing one row of the message. It is guaranteed that empty columns will be exactly between two different letters, and there will be exactly one empty column between two letters. (An empty column is considered to be one that contains only the character ’$\texttt{.}$’.)

Output Format

In a single line, print the letters that appear in the message in order.

32
\../.\../\../.\../.\../.\../\../
.\/...\/..\/...\/...\/...\/..\/.

vwvvw

27
\../\../.\../\../.\../.\../
.\/..\/...\/..\/...\/...\/.

wwvv

Hint

Subtask	Points	Constraints
$1$	$21$	The message consists of a single letter.
$2$	$13$	All letters in the message will be the same.
$3$	$16$	No additional constraints