10822: ABC150 - B - Count ABC
[Creator : ]
Description
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)?
Input
Input is given from Standard Input in the following format:
```
$N$
$S$
```
```
$N$
$S$
```
Output
Print number of occurrences of ABC in $S$ as contiguous subsequences.
Constraints
- $3 \leq N \leq 50$
- $S$ consists of uppercase English letters.
- $S$ consists of uppercase English letters.
Sample 1 Input
10
ZABCDBABCQ
Sample 1 Output
2
Two contiguous subsequences of $S$ are equal to ABC: the $2$-nd through $4$-th characters, and the $7$-th through $9$-th characters.
Sample 2 Input
19
THREEONEFOURONEFIVE
Sample 2 Output
0
No contiguous subsequences of $S$ are equal to ABC.
Sample 3 Input
33
ABCCABCBABCCABACBCBBABCBCBCBCABCB
Sample 3 Output
5