#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= M;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % M;
    a = a * a % M;
  }
  return res % M;
}
const int N = 1e5 + 10;
int main() {
  long long fib[100];
  fib[1] = fib[2] = 1;
  set<long long> s;
  s.insert(1);
  for (int i = 3; i < 100; ++i) {
    fib[i] = fib[i - 1] + fib[i - 2];
    if (fib[i] > 1000) break;
    s.insert(fib[i]);
  }
  long long n, c = 1;
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    if (s.find(i) != s.end())
      printf("O");
    else
      printf("o");
  }
  return 0;
}
