B'Dmitry has a string s , consisting of lowercase Latin letters. Dmitry decided to remove two consecutive characters from the string s and you are wondering how many different strings can be obtained after such an operation. For example, Dmitry has a string "aaabcc". You can get the following different strings: "abcc"(by deleting the first two or second and third characters), "aacc"(by deleting the third and fourth characters),"aaac"(by deleting the fourth and the fifth character) and "aaab" (by deleting the last two). The first line of input data contains a single integer t ( 1 <= t <= 10^4 ) -- number of test cases. The descriptions of the test cases follow. The first line of the description of each test case contains an integer n ( 3 <= n <= 2 cdot 10^5 ). The second line of the description of each test case contains a string s of length n consisting of lowercase Latin letters. It is guaranteed that the sum of n for all test cases does not exceed 2 cdot 10^5 . For each test case print one integer -- the number of distinct strings that can be obtained by removing two consecutive letters. The first example is explained in the statement. In the third example, the following strings are obtained: "cdef", "adef", "abef", "abcf", "abcd". In the seventh example, any deletion will result in the string "aba". '...