Contest Duration: - (local time) (100 minutes) Back to Home
A - Good morning /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

ある日、高橋君は AB 分ちょうどに、青木君は CD1 秒に起きました。

### 制約

• 0 \leq A \leq 23
• 0 \leq B \leq 59
• 0 \leq C \leq 23
• 0 \leq D \leq 59
• 入力はすべて整数である。

### 入力

A B C D


### 入力例 1

7 0 6 30


### 出力例 1

Aoki


### 入力例 2

7 30 7 30


### 出力例 2

Takahashi


### 入力例 3

0 0 23 59


### 出力例 3

Takahashi


ある日の 00 分ちょうどはその日の 01 分の 1 分前であり、 その日の 2359 分の 1 分後、すなわちいわゆる 24 時ちょうどのことではありません。 よって、高橋君の起床時刻の方が早く、Takahashi を出力します。

Score : 100 points

### Problem Statement

One day, Takahashi got up at exactly B minutes past A o'clock (in 24-hour clock), and Aoki got up at exactly D minutes and 1 second past C o'clock.
If Takahashi got up earlier than Aoki, print Takahashi; otherwise, print Aoki.

### Constraints

• 0 \leq A \leq 23
• 0 \leq B \leq 59
• 0 \leq C \leq 23
• 0 \leq D \leq 59
• All values in input are integers.

### Input

Input is given from Standard Input in the following format:

A B C D


### Output

If Takahashi got up earlier than Aoki, print Takahashi; otherwise, print Aoki.

### Sample Input 1

7 0 6 30


### Sample Output 1

Aoki


Takahashi got up at 7 sharp, and Aoki got up at 30 minutes and 1 second past 6 o'clock. Aoki was the first to get up, so Aoki should be printed.

### Sample Input 2

7 30 7 30


### Sample Output 2

Takahashi


Takahashi got up at exactly half past 7, and Aoki got up at 30 minutes and 1 second past 7 o'clock. Just by one second, Takahashi was the first to get up, so Takahashi should be printed.

### Sample Input 3

0 0 23 59


### Sample Output 3

Takahashi


0:00 in a day is one minute before 0:01, not one minute past 23:59 ("24:00"). Thus, Takahashi was the first to get up, so Takahashi should be printed.