use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        n: usize,
        s: [chars; n],
    }
    let mut a = vec![];
    let mut pos = (0, 0);
    let mut dir = (!0, 1);
    for _ in 0..(n * n) {
        a.push(s[pos.0][pos.1]);
        if !(pos.0 + dir.0 < n && pos.1 + dir.1 < n) {
            if dir == (!0, 1) {
                if pos.1 + 1 < n {
                    pos.1 += 1;
                } else {
                    pos.0 += 1;
                }
            } else {
                if pos.0 + 1 < n {
                    pos.0 += 1;
                } else {
                    pos.1 += 1;
                }
            }
            dir = (!dir.0 + 1, !dir.1 + 1);
        } else {
            pos.0 += dir.0;
            pos.1 += dir.1;
        }
    }
    let mut ans = vec![vec!['.'; n]; n];
    let mut pos = (0, 0);
    let dir = [(0, 1), (1, 0), (0, !0), (!0, 0)];
    let mut k = 0;
    for a in a {
        ans[pos.0][pos.1] = a;
        let mut d = dir[k];
        if !(pos.0 + d.0 < n && pos.1 + d.1 < n && ans[pos.0 + d.0][pos.1 + d.1] == '.') {
            k = (k + 1) % 4;
            d = dir[k];
        }
        pos.0 += d.0;
        pos.1 += d.1;
    }
    for a in ans {
        use util::*;
        println!("{}", a.iter().join(""));
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}