William and Jax are playing a game. The game is as follows :
You will be given an integer n. William goes first , In each move the player will choose any factor (excluding 1 and number itself) of the current number and replace it with chosen factor. The player who will not be able to make a move will win. Both players play the game optimally.
You have to tell which player will in the game. I William wins then output "William" else output "Jax".