Do-it, Do-it-Not

In the old days, when facing a hard decision, people sometimes used a flower to decide. You pick a flower and pull off its petals one by one, alternately saying "do it" and "do not do it"; whatever you say as you pull off the last petal is the decision.

Sanggeun applies this idea to make one difficult decision.

First, he makes a random string of 0s and 1s. Then he picks one digit from each end of the string and compares the two. If the two digits are the same, the result is "do it"; if they differ, it is "do not do it". He then discards the two chosen digits and repeats the same process on what remains. In other words, he pairs the digits from the two ends inward, and the last pair he picks (the two middle digits) determines the final decision.

Given a string of 0s and 1s, write a program that finds the decision Sanggeun makes.

The first line contains the number of test cases $N$. ($1 \le N \le 1000$)

Each test case consists of a single line containing a string of 0s and 1s. The length of the string is always even and less than 1000.

For each test case, print Do-it if Sanggeun's decision is "do it", or Do-it-Not if it is "do not do it", each on its own line.