def is_cpctf_like(s5):
    return (
        s5[0] == s5[2] and
        len(set([s5[0], s5[1], s5[3], s5[4]])) == 4
    )

def count_cpctf_like_substrings(s):
    count = 0
    for i in range(len(s) - 4):
        sub = s[i:i+5]
        if is_cpctf_like(sub):
            count += 1
    return count

# Input reading
N = int(input())
S = input().strip()
assert len(S) == N

# Output
print(count_cpctf_like_substrings(S))