Count Distinct Numbers in a String

Given a string \( S \) of length at most 100 that contains only lowercase letters and digits \(0\sim9\), where the letters are considered as separators, extract all contiguous sequences of digits and count how many distinct numbers are present. Here, each number is interpreted by ignoring any leading zeros. That is, two numbers are considered the same if their integer values are equal.

inputFormat

The input consists of a single line containing the string \( S \).

outputFormat

Output a single integer representing the count of distinct numbers found in \( S \).

sample

a123bc34d8ef34

3