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...
import java.util.Scanner;


public class Main{

	static int[][] ban;
	static boolean[] fix;
	static boolean flg = false;
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int cnt = Integer.parseInt(s.nextLine());
		ban = new int[8][8];
		fix = new boolean[8];
		for(int i=0 ; i<cnt ; i++) {
			String[] tmp = s.nextLine().split(" ");
			ban[Integer.parseInt(tmp[1])][Integer.parseInt(tmp[0])] = 1;
			fix[Integer.parseInt(tmp[1])] = true;
		}
		solve(ban, fix);

		for(int i=0 ; i<8 ; i++) {
			StringBuilder sb = new StringBuilder();
			for(int j=0 ; j<8 ; j++) {
				if(ban[j][i]==0)
					sb.append(".");
				else
					sb.append("Q");
			}
			System.out.println(sb.toString());
		}
	}

	public static void solve(int[][] ban, boolean[] fix) {
		put(0);
	}

	public static void put(int index) {

		if(index==8){
			flg = true;
			return;
		}

		if(fix[index])
			put(index+1);
		else {
		outer : for(int i=0 ; i<8 ; i++) {
			for(int j=0 ; j<8 ; j++) {
				if(index!=j) {
					if(ban[j][i]==1)
						continue outer;
				}
			}
			int record = i;
			for(int k=index+1 ; k<8 ; k++) {
				record++;
				if(k<8 && record<8) {
					if(ban[k][record]==1)
						continue outer;
				}
			}

			record = i;
			for(int l=index+1 ; l<8 ; l++) {
				record--;
				if(l<8 && record>=0) {
					if(ban[l][record] == 1)
						continue outer;
				}
			}
			record = i;
			for(int m=index-1 ; m>=0 ; m--) {
				record++;
				if(m>=0 && record<8) {
					if(ban[m][record]==1)
						continue outer;
				}
			}
			record = i;
			for(int n=index-1 ; n>=0 ; n--) {
				record--;
				if(n>=0 && record>=0) {
					if(ban[n][record]==1)
						continue outer;
				}
			}
			ban[index][i] = 1;
			put(index+1);
			if(!fix[index] && !flg)
				ban[index][i] = 0;
		}
		}
	}
}