import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Set;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author atanasova
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int[] f = new int[101];
            f[1] = 1;
            f[2] = 1;
            Set<Integer> hs = new HashSet<>();
            hs.add(1);

            for (int i = 3; i <= 100; ++i) {
                f[i] = f[i - 1] + f[i - 2];
                hs.add(f[i]);
            }
            System.out.println(Arrays.toString(f));
            int n = in.nextInt();
            String ret = "";
            for (int i = 1; i <= n; ++i) {
                if (hs.contains(i)) ret += "O";
                else ret += "o";
            }
            out.println(ret);

        }

    }
}

