#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define endl '\n'

const int chessBoardSize = 8;
#define n chessBoardSize

int col[n], dig1[2*n], dig2[2*n];
int sol[n];
int ans[n];
bool exist[n];
bool found = false;

void search(int x){

    if(x==n){
        found=true;
        return;
    }

    if(exist[x]){
        search(x+1);
        return;
    }
    
    for(int y=0;y<n;y++){
        if(col[y] || dig1[y+x] || dig2[y-x+n-1])
            continue;
        sol[x]=y;
        col[y] = dig1[y+x] = dig2[y-x+n-1] = true;
        search(x+1);
        if(found)
            return;
        col[y] = dig1[y+x] = dig2[y-x+n-1] = false;
    }

}
int main() {
   
    std::ios::sync_with_stdio(false);

    int t, x, y;
    cin>>t;
    while(t--){
        cin>>x>>y;
        sol[x]=y;
        col[y] = dig1[y+x] = dig2[y-x+n-1] = true;
        exist[x]=true;
    }

    search(0);
    
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j!=sol[i])
                cout<<'.';
            else
                cout<<'Q';
        }
        cout<<endl;
    }
    
    return 0;
}

