Prime Calling Game

Yongtae and Eugene want to play a prime-calling game. The game proceeds as follows.

1. Yongtae chooses a range of primes $A, B$. Yongtae may only call primes $A$ or greater and $B$ or less.
2. Eugene chooses a range of primes $C, D$. Eugene may only call primes $C$ or greater and $D$ or less.
3. Starting with Yongtae, the two players take turns calling a prime within their own range. A prime must not have been called by anyone earlier in the game.
4. The player who cannot call a prime any more loses.

Given the ranges for Yongtae and Eugene, who wins if both players play optimally?

The first line contains integers $A, B$ ($2 \le A \le B \le 1\ 000$), the range of primes Yongtae may call.

The second line contains integers $C, D$ ($2 \le C \le D \le 1\ 000$), the range of primes Eugene may call.

If both players play optimally and Yongtae wins, print yt. If Eugene wins, print yj.