Alice and Bob play a game.Initially they have n binary strings (a string which consists of zeroes and ones). They take alternating turns, and Alice is moving first. During each turn, the player has to choose several (at least one) strings and do one of the following operations (you can perform different operations on different strings):
1:choose a character '1', and replace it with '0'. 2:choose a contiguous substring consisting only of characters '0', and replace it with '1'(The length of the substring is at least 2).
The first line contains one integer t (1≤ t ≤100) — the number of test cases. Then the test cases follow.
For each test case, the first line contains one integern(1 ≤ n ≤ 10).
There arenlines following, the i-th of which contains a binary string of length not more than 1000.
For each test case print sdzNB if Alice can win and kgNB otherwise.