{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ of length $N$ consisting of lowercase English letters.\nFind the number of non-empty substrings of $S$ that are repetitions of one character. Here, two substrings that are equal as strings are **not** distinguished even if they are obtained differently.\nA non-empty substring of $S$ is a string of length at least one obtained by deleting zero or more characters from the beginning and zero or more characters from the end of $S$. For example, `ab` and `abc` are non-empty substrings of `abc`, while `ac` and the empty string are not."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2\\times 10^5$\n*   $S$ is a string of length $N$ consisting of lowercase English letters."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"6\naaabaa"},{"iden":"sample output 1","content":"4\n\nThe non-empty substrings of $S$ that are repetitions of one character are `a`, `aa`, `aaa`, and `b`; there are four of them. Note that there are multiple ways to obtain `a` or `aa` from $S$, but each should only be counted once."},{"iden":"sample input 2","content":"1\nx"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"12\nssskkyskkkky"},{"iden":"sample output 3","content":"8"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}