Migrated from Lutece 2845 UESTCPC Finals 2077

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Kanade takes the responsibility of commentating on the UESTCPC Finals 2077. It's known to all that the Finals contains $13$ problems. The $13$ problems are indicated by uppercase letters $\texttt{A}$ to $\texttt{M}$. Now she will explain the problem which passed by the most team but hasn't been passed by the team ranked first.

She would like to know which problem she should explain.

Input

The first line contains one integer $n\ (1\le n\le 12)$, indicating the number of problem(s) that the team ranked first now has passed.

The second line contains $n$ letters, indicating the problem(s) the team ranked first has passed. These letters are sorted by ASCII code from the smallest to the largest.

The third line contains $13$ integers $a_1,a_2,\ldots ,a_{13}\ (1\le a_i\le 150, 1\le i\le 13)$, indicating the number of team(s) passed problem $\texttt{A}$ to $\texttt{M}$ respectively.

Output

Output an uppercase letter in one line, indicating the problem she should explain. If there's multiple-choice, output the problem with the ASCII code of the corresponding letter is the smallest.

Samples

6
ABEGIL
1 1 4 5 1 4 1 9 1 9 8 1 1

H

Resources

The 18th UESTC Programming Contest Preliminary