A theatre's prop department has ten wheeled racks, numbered 0 through 9, standing in the wings. Throughout tech week, stagehands clip colored tags onto the racks to flag which props still need attention — every tag is red (R), green (G), or blue (B). You are given the full log of tag placements, in the order they happened, packed into one string: each placement is written as two characters, the tag's color followed by the digit of the rack it was clipped to. A rack that has, at any point, received at least one tag of each of the three colors is considered "fully flagged." Determine how many of the ten racks are fully flagged. (A rack may receive several tags of the same color; only the set of distinct colors it has ever seen matters, and the order of placements does not affect the final count.)

Input Format

A single line containing a string s of even length 2n, formed by concatenating n placements. Each placement is two characters: an uppercase letter in {R, G, B} followed by a decimal digit 0-9.

Output Format

Print a single integer: the number of racks (out of 0-9) that have received a tag of every one of the three colors.

Constraints

• 1 <= n <= 100
• s consists only of the characters described above, always arranged as color-then-digit pairs.

B0B6G0R6R0R6G9

1

B0R0G0R9R0B0G0

1