The goal of 8 Queens Problem is to put eight queens on a chess-board such that none of them threatens any of others. A queen threatens the squares in the same row, in the same column, or on the same diagonals as shown in the following figure.

<image>


For a given chess board where $k$ queens are already placed, find the solution of the 8 queens problem.

Constraints

* There is exactly one solution

Input

In the first line, an integer $k$ is given. In the following $k$ lines, each square where a queen is already placed is given by two integers $r$ and $c$. $r$ and $c$ respectively denotes the row number and the column number. The row/column numbers start with 0.

Output

Print a $8 \times 8$ chess board by strings where a square with a queen is represented by 'Q' and an empty square is represented by '.'.

Example

Input

2
2 2
5 3


Output

......Q.
Q.......
..Q.....
.......Q
.....Q..
...Q....
.Q......
....Q...
#from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"




def main():
    n = ii()
    donelist = []
    for i in range(n):
        tmp = li()
        donelist.append(tmp)

    anslist = [['.' for i in range(8)] for j in range(8)]


    for i in permutations(range(8)):
        lli = list(i)
        flag = False
        for tmp in donelist:
            if lli[tmp[0]] != tmp[1]:
                flag = True
        if flag:
            continue

        wa = []
        sa = []
        for e,tmp in enumerate(lli):
            if (tmp-e in sa) or (tmp+e in wa):
                flag = True
                break
            wa.append(tmp+e)
            sa.append(tmp-e)
        if not flag:
            for e,tmp in enumerate(lli):
                anslist[e][tmp] = 'Q'
                print(''.join(anslist[e]))
            exit()









main()


