
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author msagimbekov
 */
public class Codeforces918A {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] x = new int[1000];
        int a = 1;
        int b = 1;
        x[1] = a;
        x[2] = b;
        
        Set<Integer> set = new HashSet<>();
        set.add(1);
        for (int i = 3; i < x.length; i++) {
            x[i] = x[i - 1] + x[i - 2];
            set.add(x[i]);
            if (x[i] > 1000) {
                break;
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 1; i <= n; i++) {
            if (set.contains(i)) {
                sb.append("O");
            } else {
                sb.append("o");
            }
        }
        
        System.out.println(sb.toString());
    }
}
