Problem: Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. 

Unfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.

Input

The first and the single line contains the set of letters. The length of the line doesn't exceed 1000. It is guaranteed that the line starts from an opening curved bracket and ends with a closing curved bracket. Between them, small English letters are listed, separated by a comma. Each comma is followed by a space.

Output

Print a single number — the number of distinct letters in Anton's set.

Examples

Input

{a, b, c}


Output

3


Input

{b, a, b, a}


Output

2


Input

{}


Output

0

Solution (in PYTHON3):

Solution:
from collections import deque
from collections import Counter
from itertools import permutations
import heapq

def counterExample():
    arr = [1, 3, 4, 1, 2, 1, 1, 3, 4, 3, 5, 1, 2, 5, 3, 4, 5]
    counter = Counter(arr)
    top_three = counter.most_common(3)
    print(top_three)

q = deque()

#For stack we have:
#q.append()
#q.pop()

#For queue we have:
#q.append()
#q.popleft()


#for heap we have:
#heapify(a list)
#heapq.heappush()
#heapq.heappop()
#heapq.nlargest(k, iterable, key = fun)
#heapq.nsmallest(k, iterable, key = fun)





def main():
    string = input()
    newString = string[1:-1]
    letters = newString.replace(" ", "").split(",")
    d = {}
    for letter in letters:
        if letter not in d and letter >= 'a' and letter <= 'z':
            d[letter] = 1
    print(len(d.keys()))





if __name__ == "__main__":
    main()