Time Limit : sec, Memory Limit : KB
English / Japanese  

Fishing Competition

Brothers Hiroshi and Kenjiro came to Lake Inawashiro to fish. They decided to compete with the total score of the fish they caught, setting the score as follows.

.
  • One Iwana is a points
  • One Yamame is b points
  • c additional points for every 10 Iwana
  • d additional points for every 20 Yamame
.

Write a program that determines who wins or draws based on the number of fish caught by Hiroshi and Kenjiro.

Input

The input is given in the following format.

h1 h2
k1 k2
a b c d

In the first line, the number of Iwashi h1 (0 ≤ h1 ≤ 100) and Yamame h2 (0 ≤ h2 ≤ 100) caught by Hiroshi are given. In the second line, the number of Iwashi k1 (0 ≤ k1 ≤ 100) and Yamame k2 (0 ≤ k2 ≤ 100) caught by Kenjiro are given. In the third line, the point for one Iwana a(1 ≤ a ≤ 100), the point for one Yamame b (1 ≤ b ≤ 100), the additional points for every 10 Iwana c (0 ≤ c ≤ 100), and the additional points for every 20 Yamame d (0 ≤ d ≤ 100) are given.

Output

If Hiroshi wins, output hiroshi, if Kenjiro wins, output kenjiro, if it's a tie, output even on a single line.

Sample Input 1

5 1
3 1
1 2 5 5

Sample Output 1

hiroshi

Sample Input 2

5 1
4 2
1 2 5 5

Sample Output 2

kenjiro

Sample Input 3

0 20
10 0
1 1 10 0

Sample Output 3

even