#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> m;
void fibbo(long long int n) {
  int f[1005];
  f[0] = 0;
  f[1] = 1;
  m[1] = 1;
  for (long long int i = 2; i <= n; ++i) {
    f[i] = f[i - 1] + f[i - 2];
    m[f[i]] = 1;
  }
}
int main() {
  long long int n;
  cin >> n;
  fibbo(n);
  for (long long int i = 1; i <= n; ++i) {
    if (m[i] == 1)
      cout << "O";
    else
      cout << "o";
  }
}
