#include<iostream>
using namespace std;
const int N = 15;
int path[N];
bool dj[N*2],dg[N*2],col[N];
int ans,n;
void dfs(int x)
{
    if(x>n)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(path[i]!=j)
                    cout<<'.';
                else
                    cout<<'Q';
            }
            cout<<endl;
        }
        cout<<endl;
        return ;
    }
    for(int y=1;y<=n;y++)
    {
        if(!dj[y+x]&&!dg[y-x+n]&&!col[y])
        {
            dj[y+x]=dg[y-x+n]=col[y]=true;
            path[x]=y;
            dfs(x+1);
            dj[y+x]=dg[y-x+n]=col[y]=false;
            path[x]=0;
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin>>n;
    dfs(1);
    return 0;
}