Two plays in a game: in front of them is the size of a chocolate bar \textbf{N}×\textbf{M}. Players take turns. In one move is allowed break any existing piece of chocolate on a \textbf{2} "nonempty" piece, with forbidden to break pieces of not more than \textbf{1}×\textbf{S} (ie it is impossible to break the pieces that have a size equal to \textbf{1} and the other does not exceed \textbf{S} ), the pieces can be rotated. Break, of course, can only be along the lines printed on a chocolate bar, ie after the fault should be obtained two rectangles with integer sides nonzero. Plays one who can not make a move. \InputFile The input file contains three integers \textbf{N}, \textbf{M} and \textbf{S} (\textbf{0} < \textbf{N}, \textbf{M}, \textbf{S} ≤ \textbf{100}). \OutputFile Derive the output file a single number \textbf{1} or \textbf{2} - number of the player who wins at the right game.