#include<bits/stdc++.h>
using namespace std;
const int N=20;
int col[N],dg[N],udg[N],n;
char g[N][N]; 
void dfs(int k)
{
    if(k==n+1)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                printf("%c",g[i][j]);
            } 
            printf("\n");

        }
        printf("\n");
        return ;
    }
    for(int i=1;i<=n;i++)
    {
        if(!col[i] && !dg[k+i] && !udg[n-k+i])
        {
            g[k][i]='Q';
            col[i] = dg[k+i] = udg[n-k+i] = 1;
            dfs(k+1);
            col[i] = dg[k+i] = udg[n-k+i] = 0;
            g[k][i]='.';
        }
    }
}



int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            g[i][j]='.';
    dfs(1);
    return 0;
}