PROGRAMMING:Verification of ID card
The check code algorithm of Chinese ID card is as follows:
1. multiplying the 17 digits in front of the ID card number by different coefficients. The coefficients from the first to the seventeenth are 7-9-10-5-8-4-2-1-6-3-7-9-10-5-8-4-2.
1. Add the 17 digit number to the result of multiplying the coefficient. Divide the sum by 11 to get the remainder.
2. The remainder can only contain 11 numbers 0-1-2-3-4-5-6-7-8-9-10, and the number of the last ID card corresponding to them is 1-0-x-9-8-7-6-5-4-3-2. The corresponding relationship between the remainder and the check code can be calculated by the formula: M = (12-n) mod 11, where mod is the remainder operation, M is the check code, and N is the remainder calculated before. If the remainder calculated before is 3, the check code of the 18th bit is 9. If the remainder is 2, then the corresponding check code is x, and X is actually Roman numeral 10.
For example, a man's ID number is 53010219200508011x. Let's see if this ID card is a legal identity card. First, we get that the sum of the product of the first 17 digits [(5 * 7) + (3 * 9) + (0 * 10) + (1 * 5) + (0 * 8) + (2 * 4) + (1 * 2) + (9 * 1) + (2 * 6) + (0 * 3) + (0 * 7) + (5 * 9) + (0 * 10) + (8 * 5) + (0 * 8) + (1 * 4) + (1 * 2)] is 189. Then we divide 189 by 11 to get 189 / 11 = 17 - - - 2, that is to say, the remainder is 2. Finally, through the corresponding rules, we can know that the test code corresponding to the remainder 2 is X. Therefore, it can be judged that this is a correct ID number.
Please write a program, input the first 17 digits of ID card, calculate and output the final check code,
###Input format:
Each number of the first 17 digits is entered separately, with spaces in the middle
###Output format:
Output check code. If the check code is 10, it does not need to be converted to X
###Input example:
```in
5 3 0 1 0 2 1 9 2 0 0 5 0 8 0 1 1
```
###Output example:
```out
ten
```
answer：If there is no answer, please comment
1. multiplying the 17 digits in front of the ID card number by different coefficients. The coefficients from the first to the seventeenth are 7-9-10-5-8-4-2-1-6-3-7-9-10-5-8-4-2.
1. Add the 17 digit number to the result of multiplying the coefficient. Divide the sum by 11 to get the remainder.
2. The remainder can only contain 11 numbers 0-1-2-3-4-5-6-7-8-9-10, and the number of the last ID card corresponding to them is 1-0-x-9-8-7-6-5-4-3-2. The corresponding relationship between the remainder and the check code can be calculated by the formula: M = (12-n) mod 11, where mod is the remainder operation, M is the check code, and N is the remainder calculated before. If the remainder calculated before is 3, the check code of the 18th bit is 9. If the remainder is 2, then the corresponding check code is x, and X is actually Roman numeral 10.
For example, a man's ID number is 53010219200508011x. Let's see if this ID card is a legal identity card. First, we get that the sum of the product of the first 17 digits [(5 * 7) + (3 * 9) + (0 * 10) + (1 * 5) + (0 * 8) + (2 * 4) + (1 * 2) + (9 * 1) + (2 * 6) + (0 * 3) + (0 * 7) + (5 * 9) + (0 * 10) + (8 * 5) + (0 * 8) + (1 * 4) + (1 * 2)] is 189. Then we divide 189 by 11 to get 189 / 11 = 17 - - - 2, that is to say, the remainder is 2. Finally, through the corresponding rules, we can know that the test code corresponding to the remainder 2 is X. Therefore, it can be judged that this is a correct ID number.
Please write a program, input the first 17 digits of ID card, calculate and output the final check code,
###Input format:
Each number of the first 17 digits is entered separately, with spaces in the middle
###Output format:
Output check code. If the check code is 10, it does not need to be converted to X
###Input example:
```in
5 3 0 1 0 2 1 9 2 0 0 5 0 8 0 1 1
```
###Output example:
```out
ten
```
answer：If there is no answer, please comment