#include <bits/stdc++.h>
using namespace std;
set<long long> s;
int main() {
  int m, n;
  long long f[1100];
  m = 3;
  cin >> n;
  f[1] = 1;
  f[2] = 1;
  s.insert(1);
  while (m <= 1010) {
    f[m] = f[m - 1] + f[m - 2];
    s.insert(f[m]);
    m++;
  }
  for (long long i = 1; i <= n; i++)
    if (s.count(i) != 0)
      cout << "O";
    else
      cout << "o";
  cout << endl;
}
