#include <bits/stdc++.h>
using namespace std;
int fib(int n) {
  if (n < 3) return 1;
  return fib(n - 2) + fib(n - 1);
}
int main() {
  long long n;
  long long a[1000];
  int i, j;
  cin >> n;
  a[0] = 1;
  a[1] = 1;
  for (i = 2; i < n; i++) a[i] = a[i - 1] + a[i - 2];
  cout << "O";
  for (i = 2, j = 2; j <= n; j++) {
    if (j == a[i]) {
      cout << "O";
      i++;
    } else
      cout << "o";
  }
  return 0;
}
