#include <bits/stdc++.h>
int main() {
  int i, j, k, n;
  int fab[1000] = {0};
  fab[1] = 1;
  fab[2] = 1;
  scanf("%d", &n);
  for (j = 3; j <= n; j++) fab[j] = fab[j - 2] + fab[j - 1];
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (i == fab[j]) {
        printf("O");
        break;
      }
    }
    if (j > n) printf("o");
  }
  printf("\n");
  return 0;
}
