Given a string S consisting of lowercase English letters, count the number of substrings of length 3 that are palindromes.

A substring of length 3 is considered a palindrome if it reads the same forward and backward.

Task:

Return the total number of palindromic substrings of size 3 present in the string.