Even-Odd Challenge

The Even-Odd Challenge is a strategic two-player game played on a list of integers. In each move, a player selects any number from the list and either increases or decreases it by 1. This operation changes the number's parity: an even number becomes odd and an odd number becomes even.

Players take turns performing this operation, and the first player who cannot make a move loses the game. Importantly, it turns out that the outcome of the game depends solely on the number of elements, \( N \), in the list. Specifically, if \( N \) is even, then Karan (the first player) wins; if \( N \) is odd, then Kartik wins.

Your task is to determine the winner for each test case given the initial list of numbers.

inputFormat

The input begins with an integer T, the number of test cases. For each test case, the first line contains an integer N representing the number of elements in the list. The second line contains N space-separated integers.

outputFormat

For each test case, output a single line containing the winner's name: "Karan" if Karan wins (i.e. when N is even) or "Kartik" if Kartik wins (i.e. when N is odd).## sample

1
3
2 3 4

Kartik