//package cp; 
 
import java.util.*;
import java.io.*;

public class Solution
{ 
	public static void main(String[] args)  
	{ 
		FastScanner sc = new FastScanner();
		int n = sc.nextInt();
		int f[] = new int[n+2];
		f[0]=1;
		f[2]=1;
		for(int i=2 ; i<=n ; i++) {
			f[i] = f[i-1]+f[i-2];
		}
		StringBuilder sb = new StringBuilder();
		for(int i=1 ; i<=n ; i++) {
			int ff = 0;
			for(int j=0 ; j<f.length ; j++) {
				if(i == f[j]) {
					ff = 1;
					sb.append("O");
					break;
				}
			}
			if(ff==0) {
				sb.append("o");
			}
		}
		System.out.println(sb);
	}
	
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int [] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
} 

