Problem Statement
We have a string SS of length NN consisting of uppercase English letters.
How many times does ABC occur in SS as contiguous subsequences (see Sample Inputs and Outputs)?
Constraints
-
3 \leq N \leq 503≤N≤50
-
SS consists of uppercase English letters.
Input
Input is given from Standard Input in the following format:
NNSS
Output
Print number of occurrences of ABC in SS as contiguous subsequences.