Triangulation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 943    Accepted Submission(s): 389

Problem Description

There are n points in a plane, and they form a convex set. 

No, you are wrong. This is not a computational geometry problem. 

Carol and Dave are playing a game with this points. (Why not Alice and Bob? Well, perhaps they are bored. ) Starting from no edges, the two players play in turn by drawing one edge in each move. Carol plays first. An edge means a line segment connecting two different points. The edges they draw cannot have common points. 

To make this problem a bit easier for some of you, they are simutaneously playing on N planes. In each turn, the player select a plane and makes move in it. If a player cannot move in any of the planes, s/he loses. 

Given N and all n's, determine which player will win. 

 

Input

First line, number of test cases, T. 
Following are 2*T lines. For every two lines, the first line is N; the second line contains N numbers, n₁, ..., n_N. 

Sum of all N <= 10⁶. 
1<=n_i<=10⁹.

 

Output

T lines. If Carol wins the corresponding game, print 'Carol' (without quotes;) otherwise, print 'Dave' (without quotes.)

 

Sample Input

	

		2
1
2
2
2 2
	

 

Sample Output

	

		Carol
Dave
	

 

Source