Background

Mom Tihana wanted to buy her daughter Leda a plush toy via an online store. During the purchase
process, the system asked for a credit card number to be entered. However, the purchase failed
because Tihana mistakenly wrote one of the digits from that number. Internet research has revealed
that such systems recognize the wrong number based on Luhn's algorithm

Description

This algorithm confirms the correctness of the number using a control digit which is always the last
digit in the number. Steps to determine the validity of a number are:
● Starting from the second digit from the right in the number (tens of the number), double the
value of every second digit to the left. If this product is greater than nine, then the digits of that
product should be summed up.
● Calculate the sum of all values obtained in the previous step.
● The sum thus obtained should be multiplied by nine and it should be determined the
remainder of division by ten.
● If the resulting remainder is equal to the last digit of the number (unit), the number is
considered valid.
E.g. account number 79927398713 is considered valid because the end right digit 3 can be obtained
from the remaining digits in the way described
Account number 7 9 9 2 7 3 9 8 7 1 3
Double every other 7 18 9 4 7 6 9 16 7 2 -
Sum 7 9 9 4 7 6 9 7 7 2 = 67

(1+8)(6+1)
Write a program that loads the card number as a N-string that consists only of digits and exactly one
sign "x", and prints the smallest one-digit number which we can replace the sign "x" with so that the
account number is valid.

Format

Input

In the first line there is an integer number N (1 ≤ N ≤ 100), the length of string from the task's test.
In the second line there is a string of length N consisting of just signs “0”, “1”, “2”, “3”, “4”, “5”, “6”, “7” ,
“8”, “9” and exactly one sign "x".

Output

In the only line of the output it should be printed the required one-digit number.

Sample 1

Input

11
7992739871x

Output

3

Sample 2

Input

5
x2464

Output

5

Sample 3

Input

10
93380x1696

Output

1

Limitation

1s, 64 MB for each test case.

Hint

In the test samples totally worth 25 points, the sign "x" will always be in the last place in the string.

Source

COCI 2018/2019
Round #6, March 9th, 2019