You are given a binary string (s) consisting only of the characters (0) and (1). In one operation, you can do the following: Choose a substring(^{\text{∗}}) of (s) that is a palindrome(^{\text{†}}) of length at least (2). Delete exactly one character from this chosen substring. The remaining parts of the string are then concatenated to form the new string (s). Find the minimum possible length of the string (s) that can be achieved after applying this operation any number of times (possibly zero). (^{\text{∗}})A string (a) is a substring of a string (b) if (a) can be obtained from (b) by the deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end. (^{\text{†}})A string (a) of length (m) is said to be palindrome if (a_i = a_{m + 1 - i}) for all (1 \le i \le m). The first line contains a single integer (t) ((1 \le t \le 100)) — the number of test cases. Description of each test case follows. The first line of each test case contains a single integer (n) ((1 \le n \le 100)) — the length of the binary string (s). The second line of each test case contains a binary string (s) of length (n). It is guaranteed that each character of (s) is either (0) or (1). For each test case, print the minimum possible length of the string (s) that can be achieved after applying the operation any number of times. In the first test case, the initial string is (0000). We can perform the following sequence of operations: Choose the palindromic substring (0000). Delete one (0). The string becomes (000). Choose the palindromic substring (000). Delete one (0). The string becomes (00). Choose the palindromic substring (00). Delete one (0). Th