import sys
import bisect as bi
import math
from collections import defaultdict as dd
input=sys.stdin.readline
#sys.setrecursionlimit(10**7)
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())
prime1=[]
def SieveOfEratosthenes(n): #list of primes upto n
    global prime1
    prime1 = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime1[p] == True): 
            for i in range(p * p, n+1, p): 
                prime1[i] = False
        p += 1
    f=[]
    for p in range(2, n): 
        if prime1[p]: 
            f.append(p)
    return f
##n=m=0
##s=''
##t=''
##dp=[]
##def solve(inds,indt,k,cont):
##    ans=-999999999999999
##    print(dp)
##    if(k<0):return 0
##    elif(inds>=n and indt>=m):return 0
##    elif(dp[inds][indt][k][cont]!=-1):return dp[inds][indt][k][cont]
##    else:
##        if(indt<m):ans=max(ans,solve(inds,indt+1,k,0))
##        if(inds<n):ans=max(ans,solve(inds+1,indt,k,0))
##        if(s[inds]==t[indt]):
##            ans=max(ans,solve(inds+1,indt+1,k-1,1)+1)
##            if(cont):ans=max(ans,solve(inds+1,indt+1,k,1)+1)
##        dp[inds][indt][k][cont]=ans
##        return ans

    
for _ in range(1):
    n=inin()
    l=[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
    s=''
    for i in range(1,n+1):
        if(i in l):
            s+="O"
        else:
            s+="o"
    print(s)
    
        
        
    
   
        
        
        
    
        
        
    
    







    
##    n,m,k=cin()
##    s=sin().strip()
##    t=sin().strip()
##    dp=[[[[-1]*2 for i in range(k)] for i in range(m+1)] for i in range(n+1)]
##    c=0
##    for i in dp:
##        for j in i:
##            for l in j:
##                c+=1
##                print(l,c)
##    print(solve(0,0,k,0))
    
        
        
            
            
        
        
    
    
    
            
    
        
        
        
    
            
    
    
    
    
        
                
            
        
        
        
    
            
            
        
    
    
        
    

        
        
    
                
                
                
                

        
            
            
                
            
                
    
 
        
    
    
    
    




    


   
        
    
    
    
    




    


