#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
int N,p[20];
bool boo[65536],flag=0;
vector <int> ans;
void print_ans()
{
	flag=1;
	ans.push_back(0);
	for(unsigned i=0;i<ans.size();i++)
	{
		for(int j=N-1;j>=0;j--)
			if((ans[i]>>j)%2)
				printf("X");
			else
				printf("O");
		printf("\n");
	}
	ans.pop_back();
}
void dfs(int state,int step)
{
	if(flag)return;
	boo[state]=1;
	ans.push_back(state);
	for(int i=0;i<N;i++)
	{
		int temp=state^p[i];
		if(temp==0)
		{
			//printf("%d\n",step);
			if(step==p[N])
				print_ans();
			continue;
		}
		if(!boo[temp])
			dfs(temp,step+1);
	}
	ans.pop_back();
	boo[state]=0;
}
int main()
{
	freopen("rocksa.in","r",stdin);
	freopen("rocksa.out","w",stdout);
	scanf("%d",&N);
	p[0]=1;
	for(int i=1;i<=N;i++)
		p[i]=p[i-1]<<1;
	memset(boo,0,sizeof(boo));
	dfs(0,1);
	return 0;
}