P. Proooooooooooooofer
time limit per test
1 second
memory limit per test
256 megabytes
input
stdin
output
stdout

You are given an encrypted string, encrypted using a certain algorithm. Decrypt it!

Encryption algorithm gives a string t of length n and converts it to a pair (s, a) where s is a string of length n and a is a sequence of integers of length n - 2.

Input

The first line, contains an integer n. (3 ≤ n ≤ 105).

The second line, contains string s. The third line contains n - 2 integers a1, a2, ..., an - 2 seperated by space.

Each character of s is a lower case English letter (1 ≤ ai ≤ n and 1 ≤ i ≤ n - 2).

Output

Print t in the only line of output.

Examples
Input
7
chzhare
7 6 1 1 2
Output
charzeh
Input
7
youfise
4 4 2 4 2
Output
yousefi
Input
3
mmt
3
Output
mmt
Input
12
crpogprhitay
4 5 4 1 2 6 2 4 12 8
Output
cryptographi
Input
4
shti
3 1
Output
shit
Input
4
bull
1 2
Output
bull