#include<bits/stdc++.h>
    #define ll long long 
    using namespace std;
    ll ans[66];
    ll p[66];
    ll n,k;
    void dfs(ll x,ll k){
    if(x==n) return;
    if(p[n-x-1]>k){cout<<'O';dfs(x+1,k);}
    else {cout<<'X';dfs(x+1,p[n-x]-1-k);}
    }
    int main(){
    freopen("rocksa.in","r",stdin);
    freopen("rocksa.out","w",stdout);
    cin>>n;
    p[0]=1;p[1]=2;
    for(int i=2;i<=30;i++)
    p[i]=2*p[i-1];
    k=(1<<n);
    for(int i=0;i<k;i++){
    dfs(0,i);
    cout<<endl;}
	for(int i=1;i<=n;i++)
	cout<<'O';
    return 0;
    }