Problem Statement
Takahashi and Aoki are playing a game.
-
First, Takahashi chooses an integer between AA and BB (inclusive) and tells it to Aoki.
-
Next, Aoki chooses an integer between CC and DD (inclusive).
-
If the sum of these two integers is a prime, then Aoki wins; otherwise, Takahashi wins.
When the two players play optimally, which player will win?
Constraints
-
1 \leq A \leq B \leq 1001≤A≤B≤100
-
1 \leq C \leq D \leq 1001≤C≤D≤100
-
All values in input are integers.
Input
Input is given from Standard Input in the following format:
AABBCCDD
Output
If Takahashi wins when the two players play optimally, print Takahashi; if Aoki wins, print Aoki.