/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <limits>//setprecision
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
//It is so troublesome that I include bits/stdc++.h !
using namespace std;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,int> P;
//NのM乗を求める(繰り返し二乗法)
long long mod_pow(long long N, long long M) {
    if (M == 0) return 1;
    long long res = mod_pow((N * N) % MOD, M / 2);
    //最下位ビット(*N)が1の時は単独でNをかける
    if (M & 1) res = (res * N) % MOD;

    return res %= MOD;
}
long long nCr(long long n, long long r) {
    long long A = 1, B = 1;
    //Aが分子Bが1/r!
    for (long long i = n - r + 1; i <= n; i++) {
        A = A * i % MOD;
    }
    for (long long i = 1; i <= r; i++) {
        B = B * i % MOD;
    }
    B = mod_pow(B, MOD - 2);
    B %= MOD;
    //Bは割るのではなく掛ける
    return (A * B) % MOD;
}

long long gcd(long long a, long long b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}

long long lcm(long long a, long long b) {
    return a * b / gcd(a, b);
}

//long long A,B;
bool ok(long long key,long long index){
    if(index > key) return true;
    else if(index <= key) return false;
}
long long binary_search(long long key,long long size){
    //left,right,midはいずれもindex
    long long left = -1,right = size;
    while(right - left > 1){
        long long mid = left + (right-left)/2;
        long long hantei = ok(key,mid);
        if(hantei) right = mid;
        else left = mid;
    }
    if(left == -1)return 0;
    return left;
}

vector<vector<char>> ban(8,vector<char>(8));

int main() {
    int N;cin >> N;
    vector<P> retu(N);
    for(int i = 0;i<N;i++) cin >> retu.at(i).first >> retu.at(i).second;
    vector<int> Q{0,1,2,3,4,5,6,7};

    do{
        for(int i = 0;i<8;i++)for(int j = 0;j<8;j++) ban.at(i).at(j) = '.';
        for(int i = 0;i<8;i++){
            ban.at(i).at(Q.at(i)) = 'Q';
        }
        bool ok = true;
        for(int i = 0;i<N;i++){
            int X,Y; X = retu.at(i).first;Y = retu.at(i).second;
            if(ban.at(X).at(Y) != 'Q') ok = false;
        }
        

        //各クイーンについて重なるかどうかを調べる
        for(int i = 0;i<8;i++){
            int nowX = i;
            int nowY = Q.at(i);
            //斜め左上を調べる
            for(int j = 1;j<=7;j++){
                if(nowX-j < 0 || nowY-j < 0) break;
                if(ban.at(nowX-j).at(nowY-j) == 'Q') ok = false;
            }
            //斜め右上を調べる
            for(int j = 1;j<=7;j++){
                if(nowX-j < 0 || nowY+j > 7) break;
                if(ban.at(nowX-j).at(nowY+j) == 'Q') ok = false;
            }
            //斜め左下を調べる
            for(int j = 1;j<=7;j++){
                if(nowX+j > 7 || nowY-j < 0) break;
                if(ban.at(nowX+j).at(nowY-j) == 'Q') ok = false;
            }
            //斜め右下を調べる
            for(int j = 1;j<=7;j++){
                if(nowX+j >7 || nowY+j > 7) break;
                if(ban.at(nowX+j).at(nowY+j) == 'Q') ok = false;
            }
        }

        if(ok){
            for(int i = 0;i<8;i++){
                for(int j = 0;j<8;j++){
                    cout << ban.at(i).at(j);
                }
                cout << endl;
            }
            return 0;
        }

    }
    while(next_permutation(Q.begin(),Q.end()));
}



Measured memory_bytes: 3092