Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden

MAR01 - Frequent Numbers

no tags 

You have to count the distinct alphabet from a sentence.

Example: "I am a programmer" , there are  8 distinct alphabet.They are 'I','a','m','p','r','o','g','e'.

Input

Each line will contain a string, 'S' with space which will not exceeded 1000 characters.

Output

You have to count the distinct alphabet of each line.

Example

Input:
aabbcc
aa bb cc
abcd efgh xyj 123

Output:
3
3
11

Added by:Ruhul
Date:2019-09-22
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C