import java.io.*;
import java.util.*;
import java.math.*;

public class Competitive_1 {
	
	public static void main(String[] args){
		FastReader in = new FastReader();
		int n = in.nextInt();
		List<Integer> fib = new ArrayList<Integer>();
		int n1 = 1, n2 = 1;
		fib.add(n1);
		fib.add(n2);
		
		while(fib.get(fib.size()-1)<n){
			int num = n1 + n2;
			fib.add(num);
			n1 = n2;
			n2 = num;
		}
		
		StringBuilder ans = new StringBuilder();
		for(int i=1; i<=n; i++){
			if(fib.contains(i)){
				ans.append('O');
			}else{
				ans.append('o');
			}
		}
		
		System.out.println(ans);
	}
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
	
	
}
