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