#include <bits/stdc++.h>
using namespace std;
long long a[1000000];
int fib(int n) {
  long long f1 = 1, f2 = 1;
  a[0] = 1;
  a[1] = 1;
  for (int i = 2; f2 <= n; i++) {
    a[i] = f1 + f2;
    f1 = f2;
    f2 = a[i];
  }
}
int main() {
  int n = 0;
  cin >> n;
  fib(n);
  int s = 0;
  for (int i = 0; i < n; i++) {
    s = *lower_bound(a, a + n, i + 1);
    if (i + 1 == s)
      cout << "O";
    else
      cout << "o";
  }
}
