#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 9;
const int shift = 1e3 + 9;
const double Eps = 1e-7;
int f[N], n, a[N];
int main(void) {
  if (fopen("in", "r") != NULL) {
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
  }
  f[1] = f[2] = 1;
  a[1] = a[2] = 1;
  for (int i = 3; i < N; i++) {
    f[i] = f[i - 1] + f[i - 2];
    if (f[i] > 1000) break;
    a[f[i]] = 1;
  }
  while (cin >> n) {
    for (int i = 1; i <= n; i++)
      if (a[i])
        printf("O");
      else
        printf("o");
    printf("\n");
  }
  return 0;
}
