Problem Statement

We have a string $S$ of length $N$ consisting of uppercase English letters.

How many times does ABC occur in $S$ as contiguous subsequences (see Sample Inputs and Outputs)?

Constraints

• $3 \leq N \leq 50$
• $S$ consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print number of occurrences of ABC in $S$ as contiguous subsequences.