{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003ca href\u003d\"https://codeforces.com/problemset/problem/1373/B\"\u003eProblem Link\u003c/a\u003e"}},{"title":"","value":{"format":"HTML","content":"\u003cp\u003eAlica and Bob are playing a game.\u003c/p\u003e\u003cp\u003eInitially they have a binary string $$$s$$$ consisting of only characters \u003cspan class\u003d\"tex-font-style-tt\"\u003e0\u003c/span\u003e and \u003cspan class\u003d\"tex-font-style-tt\"\u003e1\u003c/span\u003e.\u003c/p\u003e\u003cp\u003eAlice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. During each move, the current player must choose two \u003cspan class\u003d\"tex-font-style-bf\"\u003edifferent adjacent\u003c/span\u003e characters of string $$$s$$$ and delete them. For example, if $$$s \u003d 1011001$$$ then the following moves are possible: \u003c/p\u003e\u003col\u003e \u003cli\u003e delete $$$s_1$$$ and $$$s_2$$$: $$$\\textbf{10}11001 \\rightarrow 11001$$$; \u003c/li\u003e\u003cli\u003e delete $$$s_2$$$ and $$$s_3$$$: $$$1\\textbf{01}1001 \\rightarrow 11001$$$; \u003c/li\u003e\u003cli\u003e delete $$$s_4$$$ and $$$s_5$$$: $$$101\\textbf{10}01 \\rightarrow 10101$$$; \u003c/li\u003e\u003cli\u003e delete $$$s_6$$$ and $$$s_7$$$: $$$10110\\textbf{01} \\rightarrow 10110$$$. \u003c/li\u003e\u003c/ol\u003e\u003cp\u003eIf a player can\u0027t make any move, they lose. Both players play optimally. You have to determine if Alice can win.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eFirst line contains one integer $$$t$$$ ($$$1 \\le t \\le 1000$$$)\u0026nbsp;— the number of test cases.\u003c/p\u003e\u003cp\u003eOnly line of each test case contains one string $$$s$$$ ($$$1 \\le |s| \\le 100$$$), consisting of only characters \u003cspan class\u003d\"tex-font-style-tt\"\u003e0\u003c/span\u003e and \u003cspan class\u003d\"tex-font-style-tt\"\u003e1\u003c/span\u003e.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case print answer in the single line.\u003c/p\u003e\u003cp\u003eIf Alice can win print \u003cspan class\u003d\"tex-font-style-tt\"\u003eDA\u003c/span\u003e (YES in Russian) in any register. Otherwise print \u003cspan class\u003d\"tex-font-style-tt\"\u003eNET\u003c/span\u003e (NO in Russian) in any register.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n01\n1111\n0011\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eDA\nNET\nNET\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case after Alice\u0027s move string $$$s$$$ become empty and Bob can not make any move.\u003c/p\u003e\u003cp\u003eIn the second test case Alice can not make any move initially.\u003c/p\u003e\u003cp\u003eIn the third test case after Alice\u0027s move string $$$s$$$ turn into $$$01$$$. Then, after Bob\u0027s move string $$$s$$$ become empty and Alice can not make any move.\u003c/p\u003e"}}]}