#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  cin >> n;

  vector<string> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }

  string str;

  for (int sum = 0; sum <= n * 2; sum++) {
    if (sum % 2 == 1) {
      for (int i = 0; i <= sum; i++) {
        int j = sum - i;
        if (i >= n || j < 0 || j >= n) continue;
        str += s[i][j];
      }
    } else {
      for (int i = sum; i >= 0; i--) {
        int j = sum - i;
        if (i >= n || j < 0 || j >= n) continue;
        str += s[i][j];
      }
    }
  }

  // cout << str << '\n';

  {
    vector<vector<int>> vis(n, vector<int>(n, 0));
    int i = 0, j = 0;
    int dx = 0, dy = 1;
    for (int _ = 0; _ < n * n; _++) {
      s[i][j] = str[_];
      vis[i][j] = true;
      if (i + dx < 0 || i + dx >= n || j + dy < 0 || j + dy >= n || vis[i + dx][j + dy]) {
        tie(dx, dy) = pair(dy, -dx);
      }
      i += dx;
      j += dy;
    }
  }

  for (int i = 0; i < n; i++) {
    cout << s[i] << '\n';
  }

  return 0;
}