Alice and Bob play a game on a binary string (s) of length (n) (a string consisting only of characters (\mathtt{0}) and (\mathtt{1})). Alice moves first, and the players take alternate turns. In one turn, a player chooses a sequence of indices (i_1, i_2, \ldots, i_m) ((1 \le i_1 < i_2 < \ldots < i_m \le n)) such that the characters at these positions form a non-increasing sequence (that is, (s_{i_1} \ge s_{i_2} \ge \ldots \ge s_{i_m})). The player then rearranges the characters at these positions to be sorted in non-decreasing order. Formally, let the chosen characters consist of (z) zeros and (o) ones (where (z + o = m)). The move replaces the characters at positions (i_1, i_2, \ldots, i_m) with a sequence of (z) zeros followed by (o) ones. A move is valid if and only if it strictly modifies the string (s) (which implies (z \ge 1) and (o \ge 1)). The player who cannot make a valid move loses. Assuming both players play optimally, determine the winner. If Alice wins, output a valid first move that is part of a winning strategy. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case consists of a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the length of the string (s). The second line of each test case contains a binary string (s) of length (n) consisting of only characters (\mathtt{0}) and (\mathtt{1}). It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output one or three lines: If Bob wins with optimal play, print a single line containing " Bob ". Otherwise, print three lines. On the first line print " Alice ". On the second line print an integer (m) ((2 \le m \le n)), and on the third line print (m) distinct integers $$$i_1, i_2, \ldots, i