Moo#5491
Sign in

Moo

1 second
128 megabytes
Easy

The cows have become engrossed in a new word game called "Moo". It is played by a group of cows standing in a long line, where each cow in sequence must quickly call out a specific letter. The first cow to make a mistake loses.

The sequence of letters in Moo can theoretically continue forever. It starts as follows:

m o o m o o o m o o m o o o o m o o m o o o m o o m o o o o o

The sequence is best described recursively: let be the -character sequence m o o. Then, a longer sequence is obtained by concatenating the sequence S(k-1), then m o ...o with k+2 o's, and then another copy of S(k-1). For example:

\begin{align*} S(0) &= \textbf{m o o} \\ S(1) &= \textbf{m o o m o o o m o o} \\ S(2) &= \textbf{m o o m o o o m o o m o o o o m o o m o o o m o o} \\ \end{align*}

As can be seen, this process constructs an infinitely long string, and this is the string of characters used for the game of Moo. Bessie the cow, feeling clever, wants to predict whether the -th character of this string will be an m or an o. Please help her!

Input

A single integer (1 \leq n \leq 10^9).

Output

The only line of output should contain a single character, either m or o.

Examples

Example

Input
4
Output
m

Example

Input
6
Output
o

Example 1

Loading
Loading

Note

In the first example, the fourth character is .

In the second example, the sixth character is .