#include <bits/stdc++.h>
const int MX = 2e5 + 69;
using namespace std;
const int mod = 1e9 + 7;
set<long long> s;
long long a[MX];
int main() {
  string ans;
  int n;
  cin >> n;
  a[1] = a[2] = 1;
  s.insert(1);
  for (int i = 3; i < 30; i++) {
    a[i] = a[i - 1] + a[i - 2];
    s.insert(a[i]);
  }
  for (int i = 0; i < n; i++) {
    if (s.count((i + 1))) {
      ans.push_back('O');
    } else {
      ans.push_back('o');
    }
  }
  cout << ans;
  return 0;
}
