#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int inf = 1e9;
const int mod = 1e9 + 7;
long long a[MAXN];
long long f[MAXN];
int32_t main() {
  long long n;
  cin >> n;
  f[1] = 1;
  f[2] = 1;
  for (long long i = 3; i <= n; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  for (long long i = 1; i <= n; i++) {
    if (binary_search(f, f + n + 1, i) == true)
      cout << "O";
    else
      cout << "o";
  }
  cout << endl;
}
