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

public class a{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        long fib[] = new long[N+10];
        fib[0]=1;
        fib[1]=1;
        for(int i=2;i<=N;++i)fib[i]=fib[i-1]+fib[i-2];
        Set<Long> st = new HashSet<>();
        for(int i=0;i<=N;++i)st.add(fib[i]);
        for(long i=1;i<=N;++i){
            if(st.contains(i)){
                System.out.print("O");
            }else{
                System.out.print("o");
            }
        }   
        System.out.println();
    }
}