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

public class Main {
    private void solve() {
        int n = nextInt();
        boolean hay[] = new boolean[n+1];
        int[] a = new int[n+1];
        a[0]=0;
        a[1]=1;
        hay[1]=true;
        if(n>=2)
        hay[2]=true;
        if(n>=3)
        hay[3]=true;
        for (int i = 2; i <= n; i++) {
            a[i]=a[i-1]+a[i-2];
            if (a[i]>n+1)break;
            hay[a[i]]=true;
        }
        for (int i = 1; i <= n; i++) {
            if(hay[i])out.print("O");
            else out.print("o");
        }
    }
    public static void main(String[] args) {
        new Main().run();
    }

    BufferedReader br;
    StringTokenizer st;
    PrintWriter out;

    private void run() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            //br = new BufferedReader(new FileReader("birthday.in"));
            //out = new PrintWriter(new FileWriter("birthday.out"));
            solve();
            br.close();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private int nextInt() {
        return Integer.parseInt(next());
    }

    private String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
                return "END_OF_FILE";
            }
        }
        return st.nextToken();
    }
}