Searching for Palindromes#670
A string is referred to as a palindrome if it reads the same forwards and backwards, such as "madam" or "bob".
Your task is to determine how many palindromes of a specified length exist within the given string .
The first line contains an integer (2 \leq K \leq 200). The second line contains the string , which is composed solely of Latin letters. Note that uppercase and lowercase letters are distinct (for example, "Bob" is not considered a palindrome). The length of ranges from to characters.
Output a single line with the number of distinct palindromes of length found in . These palindromes are sequences of consecutive characters in , with distinct palindromes being those that start at different positions within .
Example 1