#include <bits/stdc++.h>
using namespace std;
long long i, j, n, m, k, t, l, r, x, y, s, a[1000009], d[100009];
bool ok, vis[1000009];
long long mn = -1000000009, mx = 1000000009;
vector<long long> g[100009];
string p, q;
queue<int> st;
int main() {
  cin >> n;
  a[1] = 1;
  a[2] = 1;
  d[1] = 1;
  for (i = 3; i <= 10000; i++) {
    a[i] = a[i - 1] + a[i - 2];
    d[a[i]] = 1;
    if (a[i] >= 10000) break;
  }
  for (i = 1; i <= n; i++) {
    if (d[i])
      p += 'O';
    else
      p += 'o';
  }
  cout << p;
}
