#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
int main() {
  lint n;
  cin >> n;
  vector<lint> v(1001);
  v[1] = 1;
  v[2] = 1;
  for (lint i = 3; i <= n; i++) {
    v[i] = v[i - 1] + v[i - 2];
  }
  set<lint> f(v.begin(), v.end());
  for (lint i = 1; i <= n; i++) {
    if (f.find(i) == f.end()) {
      cout << "o";
    } else {
      cout << "O";
    }
  }
  cout << endl;
}
