B'Your task is to maintain a queue consisting of lowercase English letters as follows: Initially, the queue is empty. After each operation, you are asked to count the number of distinct palindromic substrings in the string that are obtained by concatenating the letters from the front to the back of the queue. Especially, the number of distinct palindromic substrings of the empty string is 0 . A string s[1..n] of length n is palindromic if s[i] = s[n-i+1] for every 1 <= q i <= q n . The string s[l..r] is a substring of string s[1..n] for every 1 <= q l <= q r <= q n . Two strings s[1..n] and t[1..m] are distinct, if at least one of the following holds. The first line is an integer q ( 1 <= q q <= q 10^6 ), indicating the number of operations. Then q lines follow. Each of the following lines contains one of the operations as follows. It is guaranteed that no "pop" operation will be performed when the queue is empty. After each operation, print the number of distinct palindromic substrings in the string presented in the queue. Let s_k be the string presented in the queue after the k -th operation, and let c_k be the number of distinct palindromic substrings of s_k . The following table shows the details of the example. It is worth pointing out that '...