#abc337a. A - Scoreboard

A - Scoreboard

Score: 100100 points

问题描述

Team Takahashi 和 Team Aoki 进行了 NN 场比赛。在第 ii 场比赛中 (1iN)(1\leq i\leq N),Team Takahashi 得分 XiX_i,Team Aoki 得分 YiY_i

从这 NN 场比赛中总得分较高的队伍获胜。

请输出胜者。如果两队总得分相同,则为平局。

以上为通义千问 qwen-max 翻译,仅供参考。

Problem Statement

Team Takahashi and Team Aoki played NN matches. In the ii-th match (1iN)(1\leq i\leq N), Team Takahashi scored XiX _ i points, and Team Aoki scored YiY _ i points.

The team with the higher total score from the NN matches wins.

Print the winner. If the two teams have the same total score, it is a draw.

Constraints

  • 1N1001\leq N\leq 100
  • 0Xi100 (1iN)0\leq X _ i\leq 100\ (1\leq i\leq N)
  • 0Yi100 (1iN)0\leq Y _ i\leq 100\ (1\leq i\leq N)
  • All input values are integers.

Input

The input is given from Standard Input in the following format:

NN

X1X _ 1 Y1Y _ 1

X2X _ 2 Y2Y _ 2

\vdots

XNX _ N YNY _ N

Output

If Team Takahashi wins, print Takahashi; if Team Aoki wins, print Aoki; if it is a draw, print Draw.

Sample Input 1

4
10 2
10 1
10 2
3 2

Sample Output 1

Takahashi

In four matches, Team Takahashi scored 3333 points, and Team Aoki scored 77 points. Team Takahashi wins, so print Takahashi.

Sample Input 2

6
5 4
4 5
2 4
1 6
7 1
3 2

Sample Output 2

Draw

Both teams scored 2222 points. It is a draw, so print Draw.

Sample Input 3

4
0 0
10 10
50 50
0 100

Sample Output 3

Aoki

One or both teams may score no points in a match.

update @ 2024/3/10 01:26:42