실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 40  통과: 19
[제출] [채점기록] [묻고답하기]

#### 문제 설명

Mirko  received a message from his friend Slavko. Slavko, being a world class cryptologist, likes to encrypt messages he sends to Mirko. This time, he decided to use One Time Pad encryption. OTP is impenetrable if used correctly, and Slavko knows this. He however, doesn't want Mirko to bang his head on an impossible task, so he sent a few hints along with his message.

Mirko knows that Slavkos original plaintext contained only small letters of the English alphabet ('a' - 'z'), full stop '.' and space ' ' (ASCII 3210). Also, he knows that Slavko used only digits '0' to '9' as his key. After much thought, he realized he can determine  locations of all spaces and full stops in the plaintext. He now asked you to write a program that will do so automatically.
From his previous dealings with Slavko, Mirko knows how OTP encryption works. Let's look at a simple example. Suppose you want to encode the string "abc efg" using "0120123" as key.

 abc efg 0120123 61  62  63  20  65  66  67 30  31  32  30  31  32  33 51  53  51  10  54  54  54 Start ASCII hexadecimal encrypted message
First, you transform both the key and plaintext into hexadecimal numbers using ASCII encoding. Then you align them and preform XOR operation on each pair. The resulting sequence is the encrypted message.

#### 입력 설명

The first line of input contains one integer N (1 ≤ N ≤ 1000), number of characters in the encrypted message.

Next line contains N integers, written in hexadecimal, larger than or equal to 010 and smaller than or equal to 12710, the encrypted message.

#### 출력 설명

The first and only line of output should contain N characters, each representing one character in the plaintext. If the ith character of plaintext is a letter, the ith character of output should be a dash '-', if not, you should output a full stop '.'.

#### 입력 예시 Copy

7
51 53 51 10 54 54 54


#### 출력 예시 Copy

---.---