import java.util.*;
public class Fibo
{
public static void main(String args[])
{
Scanner e=new Scanner(System.in);
int n=e.nextInt();
int a[]=new int[1000];
a[0]=1;
if(n>=2)
a[1]=1;
int l=0;
if(n>=2)
for(int i=2;i<1000;i++)
{
a[i]=a[i-1]+a[i-2];
if(a[i]>1000)
{
l=i;
break;
}
}
String s="O";
for(int i=2;i<=n;i++)
{
int t=search(a,0,l,i);
if(t==1)
s+="O";
else
s+="o";
}
System.out.println(s);
}
static int search(int arr[], int first, int last, int key){
int mid = (first + last)/2;  
   while( first <= last ){  
      if ( arr[mid] < key ){  
        first = mid + 1;     
      }else if ( arr[mid] == key ){  
          return(1);  
         
      }else{  
         last = mid - 1;  
      }  
      mid = (first + last)/2;  
   }  
   if ( first > last ){  
      return(0);  
   }
return 0;  
 }  
}