#include <bits/stdc++.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <deque>

using namespace std;
string process(int n,string str,int index){
	string st = str;
	if(st.size()>=n){
		return st;
	}
	string s = "ooo";
	for(int i=0;i<index;i++){
		s+='o';
	}
	index++;
	return process(n,str+'m'+s+str,index);
	
}

int main(){
	long long n;
	cin >> n;
	string s = process(n,"moo",0);
	cout << s[n-1] << endl;
	return 0;
}