
import java.util.Scanner;

public class Test {
    private static boolean fib[];
    static long values[];

    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int n = in.nextInt();
            fibValues(n);
            constructFibonacciFor(n);
            for (int i = 1; i <= n; i++) {
                if (fib[i]) {
                    System.out.print("O");
                } else {
                    System.out.print("o");
                }
            }
        }
    }

    private static void constructFibonacciFor(int n) {
        fib = new boolean[n + 1];
        for (int i = 1; i <= n; i++) {
            if (values[i] <= n) {
                fib[(int) values[i]] = true;
            }
        }
        if(n>=2)fib[2]=true;
    }

    private static void fibValues(int n) {
        values = new long[n + 1];
        for (int i = 1; i <= n; i++) {
            if (i == 1) values[i] = 1;
            else if (i == 2) values[i] = 1;
            else values[i] = values[i - 1] + values[i - 2];
            if (values[i] >= 1597) break;
        }

    }

}
