#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int DX[4] = {+1, 0, -1, 0};
constexpr int DY[4] = {0, +1, 0, -1};

int N;
char A[110][110];

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < N; ++x) {
      scanf("%s", A[x]);
    }
    
    string S;
    for (int s = 0; s <= 2 * N - 2; ++s) {
      if (s & 1) {
        for (int x = 0; x < N; ++x) {
          const int y = s - x;
          if (0 <= y && y < N) S += A[x][y];
        }
      } else {
        for (int x = N; --x >= 0; ) {
          const int y = s - x;
          if (0 <= y && y < N) S += A[x][y];
        }
      }
    }
// cerr<<S<<endl;
    
    vector<string> B(N, string(N, '.'));
    int pos = 0;
    int x = 0, y = 0;
    for (int n = N; n > 1; n -= 2) {
      for (const int dir : {1, 0, 3, 2}) {
        for (int i = 0; i < n - 1; ++i) {
          B[x][y] = S[pos++];
          x += DX[dir];
          y += DY[dir];
        }
      }
      x -= DX[2];
      y -= DY[2];
      x += DX[1];
      y += DY[1];
    }
    if (N & 1) {
      B[x][y] = S[pos++];
    }
    
    for (int x = 0; x < N; ++x) {
      puts(B[x].c_str());
    }
  }
  return 0;
}