{"raw_statement":[{"iden":"problem statement","content":"We have a string $S$ of length $N$ consisting of uppercase English letters.\nHow many times does `ABC` occur in $S$ as contiguous subsequences (see Sample Inputs and Outputs)?"},{"iden":"constraints","content":"*   $3 \\leq N \\leq 50$\n*   $S$ consists of uppercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"10\nZABCDBABCQ"},{"iden":"sample output 1","content":"2\n\nTwo contiguous subsequences of $S$ are equal to `ABC`: the $2$\\-nd through $4$\\-th characters, and the $7$\\-th through $9$\\-th characters."},{"iden":"sample input 2","content":"19\nTHREEONEFOURONEFIVE"},{"iden":"sample output 2","content":"0\n\nNo contiguous subsequences of $S$ are equal to `ABC`."},{"iden":"sample input 3","content":"33\nABCCABCBABCCABACBCBBABCBCBCBCABCB"},{"iden":"sample output 3","content":"5"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}