import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        
        int [] fib = new int[15];

        HashSet<Integer> cache = new HashSet<>();
        
        cache.add(1);
        
        fib[0] = 1;
        fib[1] = 1;
        
        for (int i = 2; i < 15; i++)
        {
            fib[i] = fib[i-1] + fib[i-2];
            cache.add(fib[i]);
        }
        
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        
        for (int j = 0; j < n ; j++)
        {
            System.out.print(cache.contains(j + 1) ? "O" : "o");
        }
    }
}
