B"In an English class Nick had nothing to do at all, and remembered about wonderful strings called palindromes. We should remind you that a string is called a palindrome if it can be read the same way both from left to right and from right to left. Here are examples of such strings: xc2 xabeye xc2 xbb, xc2 xabpop xc2 xbb, xc2 xablevel xc2 xbb, xc2 xababa xc2 xbb, xc2 xabdeed xc2 xbb, xc2 xabracecar xc2 xbb, xc2 xabrotor xc2 xbb, xc2 xabmadam xc2 xbb. Nick started to look carefully for all palindromes in the text that they were reading in the class. For each occurrence of each palindrome in the text he wrote a pair -- the position of the beginning and the position of the ending of this occurrence in the text. Nick called each occurrence of each palindrome he found in the text subpalindrome. When he found all the subpalindromes, he decided to find out how many different pairs among these subpalindromes cross. Two subpalindromes cross if they cover common positions in the text. No palindrome can cross itself. Let's look at the actions, performed by Nick, by the example of text xc2 xabbabb xc2 xbb. At first he wrote out all subpalindromes: Then Nick counted the amount of different pairs among these subpalindromes that cross. These pairs were six: Since it's very exhausting to perform all the described actions manually, Nick asked you to help him and write a program that can find out the amount of different subpalindrome pairs that cross. Two subpalindrome pairs are regarded as different if one of the pairs contains a subpalindrome that the other does not. The first input line contains integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7106) -- length of the text. The following line contains n lower-case Latin letters (from a to z). In the only line output the amount of different pairs of two subpalindromes that cross each other. Output the answer modulo 51123987."...