#include<iostream>
#include<algorithm>
using namespace std;

int n = 8;
int row[8] = {}, col[8] = {}, dpos[16] = {}, dneg[16] = {}; //0->free
int queen[8][8] = {}; //0->free

void printBoard(){
  
  for(int i = 0;i < n;i++){
    for(int j = 0;j < n;j++){
      if(queen[i][j] && row[i] != j) return ;
    }
  }
  
  for(int i = 0;i < n;i++){
    for(int j = 0;j < n;j++){
      if(row[i] == j) cout << 'Q';
      else cout << '.';
    }
    cout << endl;
  }
}

void putQueen(int i){
  
  if(i == n){
    printBoard();
    return ;
  }
  
  for(int j = 0;j < n;j++){
    if(col[j] || dpos[i + j] || dneg[i - j + n - 1]) continue;
    
    row[i] = j;
    col[j] = dpos[i + j] = dneg[i - j + n - 1] = 1; //not free
    
    putQueen(i + 1);
    
    col[j] = dpos[i + j] = dneg[i - j + n - 1] = 0; //free
  }
}

int main(){
  
  int k, r, c;
  
  cin >> k;
  for(int i = 0;i < k;i++){
    cin >> r >> c;
    queen[r][c] = 1;
  }
  
  putQueen(0);
  
  return 0;
}
