import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Scanner;
public class qwe {
    public static void main(String[]args){
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        LinkedList<Integer> arr = new LinkedList<Integer>();
        fib(a,arr);
        for(int i=0;i<a;i++){
            if(arr.contains(Integer.valueOf(i+1))){
            System.out.print("O");}
            else System.out.print("o");
        }
    }
    
    static void fib(int a,LinkedList<Integer> arr){
        int n1=0,n2=1,n3=0;    
        arr.addLast(n1);arr.addLast(n2);
        for(int i=2;n3<=a;++i){
            n3=n1+n2;arr.addLast(n3);
            n1=n2;n2=n3;
        }
//        if(a==0 || a==1)return 1;
  //      else return fib(a-2)+fib(a-1);
    }
}