In their free time, Santa Claus Petrovich and Santa Claus Egorych play the following game. Pawns are arranged on a board \textbf{3}×\textbf{3} in the following way: \includegraphics{https://static.e-olymp.com/content/4c/4c67d6521828e53a4d0172fb99d213ed51c6bb55.jpg} Pawns move and attack according to the standard chess rules, and there is one additional rule: it is obligatory to attack. The one who cannot make a move loses. White moves first. For the last 100 years, Petrovich have been playing white and he always won. Once Egorych became tired of this and brought a board \textbf{3}×\textbf{5}. But he again was losing constantly playing black. "\textit{What's the matter}", he thought and decided to buy a board \textbf{3}×\textbf{N}: \includegraphics{https://static.e-olymp.com/content/d7/d7ed8fe2f51abf45018fab09ac7592f2ce1b7283.jpg} And here Petrovich has to think which color to play in order to win. Help him to decide. \InputFile The integer \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{10^9}). \OutputFile \textbf{White}, if Petrovich should play white, and \textbf{Black}, if he should play black. Egorych and Petrovich always make moves according to their optimal strategies.