#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long maxn = 3e6;
const long long mod = 1e9 + 7;
const long double PI = acos((long double)-1);
long long pw(long long a, long long b, long long md = mod) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (a * res) % md;
    }
    a = (a * a) % md;
    b >>= 1;
  }
  return (res);
}
bool fib[maxn];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int a = 1, b = 1;
  while (b < maxn) {
    fib[b] = 1;
    int c = b;
    b = a + b;
    a = c;
  }
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cout << ((fib[i]) ? "O" : "o");
  return (0);
}
