#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

trait Joinable {
    fn join(self, sep: &str) -> String;
}

impl<U: ToString, T: Iterator<Item = U>> Joinable for T {
    fn join(self, sep: &str) -> String {
        self.map(|x| x.to_string()).collect::<Vec<_>>().join(sep)
    }
}

struct Permutation<T: Ord + Clone> {
    v: Vec<T>,
    ended: bool,
}

impl<T: Ord + Clone> Permutation<T> {
    fn new(v: Vec<T>) -> Permutation<T> {
        Permutation { v: v, ended: false }
    }
    fn next_permutation(&mut self) -> bool {
        let v = &mut self.v;
        let mut k = v.len() - 1;
        while k > 0 && v[k - 1] > v[k] {
            k -= 1;
        };
        if k == 0 {
            v.reverse();
            return false;
        }
        k -= 1;
        let mut l = v.len() - 1;
        while l > k && v[k] > v[l] {
            l -= 1;
        }
        v.swap(k, l);
        v[k + 1..].reverse();
        true
    }

}

impl<T: Ord + Clone> Iterator for Permutation<T> {
    type Item = Vec<T>;
    fn next(&mut self) -> Option<Self::Item> {
        let ret = self.v.clone();
        if self.ended {
            return None;
        }
        if !self.next_permutation() {
            self.ended = true;
        }
        Some(ret)
    }
}

const INF: i64 = 1 << 60;

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let k: usize = sc.get();
    let mut v0 = vec![INF; 8];
    for _ in 0..k {
        let y: usize = sc.get();
        let x: i64 = sc.get();
        v0[y] = x;
    }
    let mut ans = Vec::new();
    let v: Vec<i64> = (0..8).collect();
    'outer: for p in Permutation::new(v) {
        let mut ok = true;
        for row in 0..8 {
            if v0[row] == INF {
                continue;
            }
            if p[row] != v0[row] {
                continue 'outer;
            }
        }
        for row1 in 0..8 {
            for row2 in 0..8 {
                if row1 == row2 { continue; }
                ok &= i64::abs(p[row1 as usize] - p[row2 as usize]) != i64::abs(row1 - row2);
            }
        }
        if ok {
            ans = p;
            break;
        }
    }
    for row in 0..8 {
        for col in 0..8 {
            if col == ans[row] {
                print!("Q");
            } else {
                print!(".");
            }
        }
        println!("");
    }
}



Measured memory_bytes: 5044