Problem2328--Palindromic Indices （CF1682A）

2328: Palindromic Indices （CF1682A）

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

SubmitSolved: 6Submit Num: 15Statistics

Description

You are given a palindromic string ss of length nn.

You have to count the number of indices ii (1≤i≤n)(1≤i≤n) such that the string after removing sisi from ss still remains a palindrome.

For example, consider ss = "aba"

  1. If we remove s1s1 from ss, the string becomes "ba" which is not a palindrome.
  2. If we remove s2s2 from ss, the string becomes "aa" which is a palindrome.
  3. If we remove s3s3 from ss, the string becomes "ab" which is not a palindrome.

A palindrome is a string that reads the same backward as forward. For example, "abba", "a", "fef" are palindromes whereas "codeforces", "acd", "xy" are not.

Input

The input consists of multiple test cases. The first line of the input contains a single integer tt (1≤t≤103)(1≤t≤103)  — the number of test cases. Description of the test cases follows.

The first line of each testcase contains a single integer nn (2≤n≤105)(2≤n≤105)  — the length of string ss.

The second line of each test case contains a string ss consisting of lowercase English letters. It is guaranteed that ss is a palindrome.

It is guaranteed that sum of nn over all test cases does not exceed 2⋅1052⋅105.

Output

For each test case, output a single integer  — the number of indices ii (1≤i≤n)(1≤i≤n) such that the string after removing sisi from ss still remains a palindrome.

Sample Input Copy 

3
3
aba
8
acaaaaca
2
dd

Sample Output Copy 

1
4
2

HINT

Note

The first test case is described in the statement.

In the second test case, the indices ii that result in palindrome after removing sisi are 3,4,5,63,4,5,6. Hence the answer is 44.

In the third test case, removal of any of the indices results in "d" which is a palindrome. Hence the answer is 22.

Source/Category

CodeForces 
Submit