# For Solution

You might be given a binary string SS of size NN.

It’s important to carry out the next operation precisely as soon as:

• Choose an index ii (1iN)(1≤i≤N) and delete SiSi from SS. The remaining elements of SS are concatenated in the identical order.

What number of distinct binary strings of size N1N−1 are you able to get after making use of this operation?

## Distinct Binary Strings solution codechef

• The primary line of enter accommodates a single integer TT – the variety of take a look at circumstances. The outline of TT take a look at circumstances observe.
• The primary line of every take a look at case accommodates NN – the size of the binary string SS.
• The second line accommodates the binary string SS.

### Output Format

For every take a look at case, output the variety of distinct binary strings that you could get after making use of the operation precisely as soon as.

## Distinct Binary Strings solution codechef

• 1T1051≤T≤105
• 2N1052≤N≤105
• Sum of NN doesn’t exceed 21052⋅105 over all testcases.

### Pattern Enter 1

3
3
100
4
1111
5
10110


### Pattern Output 1

2
1
4


## Distinct Binary Strings solution codechef

Take a look at Case 1: We’ve got S=100S=100. Now, we will get 0000 (on deleting S1S1), 1010 (on deleting S2S2) and 1010 (on deleting S3S3). Subsequently, we will get 22 distinct strings.

Take a look at Case 2: We’ve got S=1111S=1111. Now, we’ll at all times get 111111 regardless of the index ii on which we apply the operation. Subsequently, we will get 11 distinct string.