#include <bits/stdc++.h>
using namespace std;
const long long int INF = (1 << 28);
const long long int MOD = (1e9 + 7);
int fibresult[10001];
int n;
void fib() {
  fibresult[0] = 1;
  fibresult[1] = 1;
  for (int i = 2; i <= 1001; i++)
    fibresult[i] = fibresult[i - 1] + fibresult[i - 2];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  fib();
  string ans = "";
  for (int i = 1; i <= n; i++) {
    if (binary_search(fibresult, fibresult + n + 1, i))
      ans += 'O';
    else
      ans += 'o';
  }
  cout << ans << '\n';
  return 0;
}
