import java.util.*;
/**
* @author
* @create 2021-04-15 19:34
*/
public class Solution1 {
static int niumei;
static int niuniu;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()){
int n = scan.nextInt();
scan.nextLine();
for (int i = 0; i < n; i++) {
String s = scan.nextLine();
String winner = winner(s);
if (winner != "Draw"){
System.out.println(winner);
System.out.println(Math.abs(niumei - niuniu));
}else {
System.out.println("Draw");
}
niuniu = 0;
niumei = 0;
}
}
}
/**
* 思路:由于每次消消乐都以最佳方式进行,所以两人每次都会选择相邻最多的1进行消除。
* 那么以0为分界线,统计每个零之间1的数量,将他们各自相加后按由大到小排序,先手的会
* 选择偶数索引代表的值,后手的会选择奇数下标代表的值
* @param s
* @return
*/
public static String winner(String s){
char[] chars = s.toCharArray();
ArrayList<Integer> list = new ArrayList<>();
for (int i = 0; i < s.length(); i++) {
if (chars[i] == '0'){
list.add(i);
}
}
if (list.size() == 0){
//全部为1的情况
niumei = s.length();
niuniu = 0;
return "Niumei";
}
//不全部为1的情况,以0为分界点
ArrayList<Integer> diff = new ArrayList<>();
diff.add(list.get(0));//先加入第一个0之前的1的总和
diff.add(s.length()-list.get(list.size()-1)-1);//加入最后一个0之后的1的总和
for (int i = 1; i < list.size(); i++) {
diff.add(list.get(i)- list.get(i-1)-1);
}
diff.removeIf(in -> in <= 0);//排除掉diff中小于等于0的值
Collections.sort(diff, new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return -o1.compareTo(o2);
}
});//list由大到小排序
for (int i = 0; i < diff.size(); i++) {
if ((i & 1) == 0){//偶数和为牛妹得分,先手
niumei += diff.get(i);
}else {//奇数和为牛牛得分,后手
niuniu += diff.get(i);
}
}
if (niumei > niuniu){
return "Niumei";
}else if (niumei < niuniu){
return "Niuniu";
}else {
return "Draw";
}
}
}