Hide

Problem O
Fjöldi Bókstafa

Languages en is

The Countess of Counting has for as long as she can remember counted anything and everything, including all the letters in books she reads. Now the Countess wants to be sure she has counted the letters in her most recent reading correctly.

Input

One line with $n$ ASCII symbols and no spaces. It is guaranteed that $1 \leq n \leq 100$.

Output

One line containing the number of letters in the input. The symbols from $a$ to $z$ and $A$ to $Z$ are the ASCII symbols that count as letters.

Scoring

Group

Points

Constraints

1

10

Only lower case letters in the input.

2

10

Only upper case letters in the input.

3

30

Only lower and upper case letters in the input.

4

50

Upper and lower case letters along with other symbols in the input.

Sample Input 1 Sample Output 1
helloworld
10
Sample Input 2 Sample Output 2
ALL_YOUR_BASE_ARE_BELONG_TO_US.
24

Please log in to submit a solution to this problem

Log in