#include <bits/stdc++.h>
using namespace std;
int tfibo[1001];
void fibo(int n) {
  tfibo[0] = 1;
  tfibo[1] = 1;
  for (int i = 2; i <= n; i++) {
    tfibo[i] = tfibo[i - 1] + tfibo[i - 2];
  }
}
int main() {
  int n;
  cin >> n;
  fibo(n);
  for (int i = 1; i <= n; i++) {
    if (find(tfibo, tfibo + n + 1, i) != tfibo + n + 1)
      cout << "O";
    else
      cout << "o";
  }
  return 0;
}
