918A - Eleven - CodeForces Solution

/* بِسْمِ اللَّـهِ الرَّحْمَـٰنِ الرَّحِيمِ */
#include<bits/stdc++.h>

#define accelerate cin.tie(0); cin.sync_with_stdio(0);
typedef long long ll;
using namespace std;


bool sortPairBySecondElement(const pair<int, int> &a, const pair<int, int> &b);

vector<ll> factorization(ll n);

vector<bool> segmentedSieve(long long L, long long R);

bool isPrim(ll number);

vector<bool> sieve(ll sieveNumber);

long long binaryExponentiation(long long number, long long power, int mod);


bool fre[2000];
int coun;
int maxi[5000];

int fib(int number) {
    if (number <= 1)
        return 1;
    if (maxi[number])
        return maxi[number];

    maxi[number] = fib(number - 1) + fib(number - 2);
    fre[maxi[number]] = true;
    return maxi[number];
}


int main() {
    accelerate
    fib(17);
    int input;
    cin >> input;
    for (int i = 1; i <= input; ++i) {
        if (fre[i] || i == 1)cout << 'O';
        else cout << 'o';
    }
}