
import java.math.BigInteger;
import java.util.Scanner;

public class Test 
{
    public static String rec(int a , int b , int n)
    {
        if(a + b > n)
            return "";
        
        int c = a + b;
        
        return c + " " + rec(b , c , n);
   
    }
 
 
    public static int[] fib(int n)
    {
        String s = "1 1 " + rec(1 , 1 , n);
        
        String[] a1 = s.split(" ");
        int[] a2 = new int[a1.length];
        
        for(int i = 0 ; i<a1.length ; i++)
            a2[i] = Integer.parseInt(a1[i]);
        
        return a2;
        
    }
    
    public static boolean is(int[] a , int n )
    {
        for(int i = 0 ; i<a.length ; i++)
            if(a[i] == n)
                return true;
        
        
        return false;
        
    }
        

    public static void main(String[] args)
    {

        
        Scanner in = new Scanner(System.in);
        
        int n = in.nextInt();
        
        int[] a = fib(n);
        
        
        String result = "";
        
        for(int i = 1 ; i<=n ; i++)
        {
            if(is(a , i))
                result += 'O';
            else
                result += 'o';
        }
            
   
        System.out.println(result);
    }
}
