Anagram Day

Who among the LKSh students doesn't love anagrams? They're a fun way to play with names, surnames, city names, and more. However, the chipmunk Sergey prefers experimenting with his favorite sequences of non-negative integers. To do this, he first needs to convert each sequence into a string using a straightforward algorithm:

Consider a sequence (a) of length (n). A prime number (p) is chosen such that (n < p $\le$ 30000) and (26 < p). We define a function. Sergey always selects (p) such that (0 $\le$ f(k) $\le$ 26) for all (k) from (1) to (n). Then, the values of the function (f(1), f(2), ..., f(n)) are calculated sequentially. The resulting function values (1..26) correspond to the letters of the Latin alphabet (a..z), while (0) corresponds to the symbol '(*)'. These symbols are appended to an initially empty string (s) after each calculation of the function value (f(k)).

Sergey asserts that from the resulting string (s) and the number (p), the original sequence can always be reconstructed. Can you do it?

Input

The first line of the input file contains the number (p) and the string (s). The length of the string (s) does not exceed (70) characters.

Output

The single line of the output file should contain (n) integers, separated by spaces - the original sequence (a).

Examples