#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
using namespace std;
const int num = 8;
int tf[num][num], col[num], ld[num*2-1], rd[num*2-1], row[num];
inline void print() {
	for (int i = 0; i < num; i++) {
		for (int j = 0; j < num; j++) {
			if (tf[i][j])
				if (row[i] != j) return;
		}
	}
	for (int i = 0; i < num; i++) {
		for (int j = 0; j < num; j++) {
			cout << (row[i] == j ? "Q" : ".");
		}
		cout << endl;
	}
}
inline void queen(int i) {
	if (i == num) {
		print();
		return;
	}
	else {
		for (int j = 0; j < num; j++) {
			if (!col[j] || !ld[i + j] || !rd[i - j + num - 1]) continue;
			row[i] = j;
			col[j] = ld[i + j] = rd[i - j + num - 1] = 0;
			queen(i + 1);
			col[j] = ld[i + j] = rd[i - j + num - 1] = 1;
			row[i] = -1;
		}
	}
}
int main() {
	for (int i = 0; i < num; i++) {
		for (int j = 0; j < num; j++) tf[i][j] = 0;
		col[i] = 1; row[i] = -1;
	}
	for (int i = 0; i < num * 2 - 1; i++) ld[i] = rd[i] = 1;
	int n, x, y;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> x >> y;
		tf[x][y] = 1;
	}
	queen(0);
	return 0;
}