#include <vector>
#include <set>

using namespace std;

template<class C>
vector<vector<C> > permutations(vector<C> L) {
  int i, j, k;
  vector<vector<C> > ans;
  if (L.size() <= 1) {
    ans.push_back(vector<C>(L));
  } else {
    for (i = 0; i < (int) L.size(); i++) {
      vector<C> sub;
      for (j = 0; j < (int) L.size(); j++) {
        if (j != i) { sub.push_back(L[j]); }
      }
      vector<vector<C> > p = permutations(sub);
      for (j = 0; j < (int) p.size(); j++) {
        vector<C> temp;
        temp.push_back(L[i]);
        for (k = 0; k < (int) p[j].size(); k++) {
          temp.push_back(p[j][k]);
        }
        ans.push_back(temp);
      }
    }
  }
  return ans;
}

vector<vector<int> > queens(int n) {
  int i, j;
  vector<vector<int> > ans;
  vector<int> L;
  for (i = 0; i < n; i++) {
    L.push_back(i);
  }
  vector<vector<int> > p = permutations(L);
  for (i = 0; i < (int) p.size(); i++) {
    set<int> main_diag, skew_diag;
    for (j = 0; j < n; j++) {
      main_diag.insert(j+p[i][j]);
      skew_diag.insert(j-p[i][j]);
    }
    if (main_diag.size() == n && skew_diag.size() == n) {
      ans.push_back(p[i]);
    }
  }
  return ans;
}

int main() {
  int j;
  vector<vector<int> > q = queens(8);
  for (int i = 0; i < (int) q.size(); i++) {
    for (int col = 0; col < (int) q[i].size(); col++) {
      for (j = 0; j < q[i][col]; j++) {
        printf(".");
      }
      printf("Q");
      for (j = q[i][col] + 1; j < 8; j++) {
        printf(".");
      }
      printf("\n");
    }
    printf("\n");
  }
  return 0;
}