def dfs(cur, max_row, cols, col_mask):
    if cur == max_row:
        for i in range(max_row):
            col = cols[i]
            print(col*'.' + 'Q' + (max_row - col - 1) * '.')
        print()
        return

    for col in range(max_row):
        if (1 << col) & col_mask == 0:
            flag = True
            for i in range(cur):
                if abs(i-cur) == abs(col -cols[i]):
                    flag = False    
                    break

            if flag:
                cols.append(col)
                dfs(cur+1, max_row, cols, col_mask | (1 << col))
                cols.pop(-1)


n = int(input())
dfs(0, n, [], 0)