Up and Down

Interview

Time limit2sMemory limit512 MB

Summary

Two walkers repeat a forward/backward step cycle; after s steps, report whose distance from the start is greater, or Tied.

Level: Easy3 of 10
Topics: Simulation, Math, Implementation, Array
Solved: No attempts yet

Problem

Nikky and Byron are playing a simple game in gym class.

Nikky's teacher tells him to walk forward $a$ steps ( $1 \le a \le 100$ ) and then backward $b$ steps ( $1 \le b \le 100$ ), and to keep repeating this pattern: $a$ forward, $b$ backward, $a$ forward, $b$ backward, and so on. Byron is told to walk forward $c$ steps ( $1 \le c \le 100$ ) and then backward $d$ steps ( $1 \le d \le 100$ ), repeating $c$ forward, $d$ backward, and so on. You may assume that $a \ge b$ and $c \ge d$ .

Nikky and Byron have the same step length, and they take every step at the same time (both take their first step forward simultaneously, and each step after that is simultaneous as well).

Both start from one end of a soccer field. After a total of $s$ steps ( $1 \le s \le 10000$ ), the gym teacher blows the whistle. Determine who is farther from the starting position at that moment.

Input

Five integers $a$ , $b$ , $c$ , $d$ , and $s$ , each on its own line.

Output

Print exactly one of the following:

Nikky if Nikky is farther from the start after $s$ steps,
Byron if Byron is farther from the start,
Tied if both are the same distance from the start.

Examples3

Example 1
Input
```
4
2
5
3
12
```
Expected output
```
Byron
```
Example 2
Input
```
1
1
1
1
1
```
Expected output
```
Tied
```
Example 3
Input
```
10
1
2
1
5
```
Expected output
```
Nikky
```