#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
vector<int> v2;
unordered_map<int, int> m;
int main() {
  scanf("%d", &n);
  v.resize(n);
  m[1] = 1;
  m[2] = 1;
  int t1 = 1, t2 = 1;
  int nextTerm = 0;
  while (true) {
    nextTerm = t1 + t2;
    t1 = t2;
    t2 = nextTerm;
    m[nextTerm] = 1;
    if (nextTerm > n) break;
  }
  string out;
  for (int i = 1; i <= n; i++) {
    if (m.find(i) == m.end()) {
      out += 'o';
    } else {
      out += 'O';
    }
  }
  cout << out;
  return 0;
}
