C. Leafilians
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

George and Mohamed want to get in shape, so George tells Mohamed, "Lets go leafilians," "a type of person who only eats leaves".

They found a delicious tree (undirected connected graph with $$$n$$$ nodes and $$$n-1$$$ edges).

They start eating in turns. George starts eating first. In each turn to get full, the one who eats will do one of these two operations:

  1. Eat all leaves of the tree.
  2. Save one of the leaves and eat the rest.

The one who can't eat a leaf at the end will go eat Shawarma and lose.

A leaf node is a node with degree less than or equal to 1.

Can you tell us who will win and stay leafilians?

Input

The first line contains the number of test cases $$$t$$$ $$$( 1 \le t \le 10^{5} )$$$. A description of the test cases follows.

The first line of each test case contains a single integer $$$n$$$ $$$( 1 \le n \le 10^{5} )$$$ indicating the number of nodes in the tree.

The following $$$n-1$$$ lines of each test case describe the edges of the tree.The $$$i$$$-th of these lines contains two integers $$$u_i$$$ and $$$v_i$$$ $$$( 1 \le u_i , v_i \le n , u_i \not = v_i )$$$ the indices of the vertices connected by the $$$i$$$-th edge.

It is guaranteed that the given edges form a tree.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^{5}$$$.

Output

For each test case, print "Go8" if George wins; otherwise, print "Neodoomer".

Example
Input
2
1
3
1 2
1 3
Output
Go8
Neodoomer