Decode the Ancient Message

You are given a sequence of space-separated integers representing an encoded ancient message. The secret is encoded using a special mapping:

• $15 \rightarrow \text{Sphinx}$
• $9 \rightarrow \text{Leviathan}$
• $3 \rightarrow \text{Cerberus}$
• $1 \rightarrow \text{Dragon}$

Your task is to decode the message by counting how many of these special numbers appear in the given sequence. Each special number is only counted once, regardless of its frequency in the input.

Example:

Input: 3 9 15 1
Output: 4

The output is 4 because all four special numbers appear in the input.

inputFormat

The input is provided via standard input (stdin) as a single line containing space-separated integers.

Note: There is no extra information provided such as the count of numbers; you should process all the integers present in the input.

outputFormat

Print a single integer to standard output (stdout) representing the number of unique special numbers found in the input.

## sample

3 9 15 1

4