#include <bits/stdc++.h>   using namespace std;   vector<long int> fib(46, -1);   int adv_fib(int n) {     if (n == 0 || n == 1) {       return 1;     } else if (fib[n] == -1) {       return fib[n] = adv_fib(n - 1) + adv_fib(n - 2);     } else {       return fib[n];     }   }   int main() {     int n, curr = 1;     cin >> n;     for (int i = 1; i <= n; i++) {       if (adv_fib(curr) == i) {         cout <<  O ;         curr++;       } else {         cout <<  o ;       }     }   }   