Knight Borna is trying to decipher secret letters of his enemies. He recently came into possession of a special piece of paper that is used for the cipher. The paper contains a single word, made up of lowercase letters and digits.
The secret code is the number of distinct integers that appear in the word, when all letters are replaced with whitespace. The integers are written without leading zeroes.
Since Borna is not very good with numbers, he turned to you for help.
Input Specification
The first line contains a word of length between and . The word contains only lowercase letters and digits. All integers in it have at most three digits.
Output Specification
Output the secret code.
Constraints
Subtask | Points | Constraints |
---|---|---|
1 | 20 | All integers will be pairwise distinct. |
2 | 30 | No additional constraints. |
Sample Input 1
abc123abc2a3a1
Sample Output 1
4
Sample Input 2
borna123vitez
Sample Output 2
1
Sample Input 3
as23dkrf23smk1asd23sam9
Sample Output 3
3
Comments