K. Koala Harris VS Donald Trunk
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

NBC News: "This year, more than any in recent memory, global democracy rests on the edge of a knife: Never before will so many people around the world have the opportunity to vote, but rarely have democracy's core tenets been so fundamentally threatened."

Indeed, 2024 is treated by many as not just an election year, but perhaps The "Super Election Year." To quote from another news article from Reuters, "Elections are taking place this year in countries home to almost half of the world's population, from Taiwan's general election in January to the U.S. presidential race in November". (4.2 billion population in over 76 countries/regions, including eight of the world's ten most populous countries, to be more precise.) Although the majority of you are yet to be eligible to vote because of the 18-year-old age requirement, nor are there elections for you to vote in this current year, we as programmers can still look into the presidential election of the one nation governing all technology: the fictional United States of Byteland (USB).

The United States of Byteland is a federation union of $$$N$$$ states, numbered from $$$1$$$ to $$$N$$$. There are 2 candidates, Koala Harris and Donald Trunk, who are running for president in this USB presidential election. On Election Day to be held later in HEXember, each voter will cast a vote for their preferred candidate. However, the winner is not the person who gets the most votes across the nation; instead, these candidates actually compete to win across each of the $$$N$$$ states.

Each state has a pre-designated number of electoral votes, denoted by $$$E_i$$$ for the $$$i$$$-th state. States have a winner-takes-all rule, meaning that the candidate who receives the highest number of normal votes from that state wins ALL of that state's $$$E_i$$$ electoral votes. In the end, the candidate who accumulates the most electoral votes across all states wins the nation-wide election.

The whole programmer world has been keeping a close eye on this fictional Byteland election. Now that you understand the election mechanism, given the number of votes received by each of the candidates in each state, determine who will be the next President of the United States of Byteland.

Input

The first line contains an integer $$$N$$$ ($$$2 \leq N \leq 500$$$), the number of states.

The $$$i$$$-th line of the following $$$N$$$ lines each contains $$$3$$$ integers: $$$E_i, K_i, T_i$$$.

  • $$$E_i$$$ ($$$1 \le E_i \le 100$$$) denotes the number of electoral votes assigned to the $$$i$$$-th state, and
  • $$$K_i, T_i$$$ ($$$0 \le K_i, T_i \le 10^8$$$) denotes the number of votes received by Koala and Trunk, respectively, in the $$$i$$$-th state.

It is guaranteed that:

  • There is no tie for the most votes in any state.
  • There is no tie in the final count of electoral votes.
Output

Output Koala or Trunk, the winner of the election.

Example
Input
5
6 10 56
8 94 7
9 65 78
5 34 65
2 45 40
Output
Trunk
Note

Explanation for sample 1:

  • In State 1, Trunk wins with 56 votes against 10 votes. Trunk is awarded 6 electoral votes.
  • In State 2, Koala wins with 94 votes against 7 votes. Koala is awarded 8 electoral votes.
  • In State 3, Trunk wins with 78 votes against 65 votes. Trunk is awarded 9 electoral votes.
  • In State 4, Trunk wins with 65 votes against 34 votes. Trunk is awarded 5 electoral votes.
  • In State 5, Koala wins with 45 votes against 40 votes. Koala is awarded 2 electoral votes.

In the end, Trunk wins with $$$6 + 9 + 5 = 20$$$ electoral votes, versus Koala with $$$8 + 2 = 10$$$ electoral votes.