#include <stdio.h>
int maxn = 10;

int main() {
    int n, k, f;
    f = 0;
    int m[maxn][maxn];
    scanf("%i", &n);
    for (int i = 0; i != n; ++i) {
        for (int j = 0; j != n; ++j) {
        scanf("%d", &m[i][j]);
    }
}
    int l = 0;
    int p = 0;
    int i, j, k1;
    k = 1;
    i = n - 1;
    j = n - 1;
    printf("%d \n", m[i][j]);
    if (n > 1) {
    i--;
    printf("%d \n", m[i][j]);
}
    while (l < n * n - 2) {
        while (k != n) {
        p = k;
        while (p > 0) {
        //  printf("cyc1up i = %d j = %d l = %d k = %d\n", i, j, l ,k);
            i++; j--;
            printf("%d \n", m[i][j]);
            l++;
            p--;
        }

    k++;
    if (k == n) {
        break;
    }
    j--;
    l++;
    printf("%d \n", m[i][j]);
    p = k;
    while (p > 0) {
     // printf("cyc2up i = %d j = %d l = %d k = %d\n", i, j, l ,k);
        i--; j++;
        printf("%d \n", m[i][j]);
        l++;
        p--;
    }

    k++;
    //printf("k = %d\n", k);
  if (k == n) {
        break;
    }
    i--;
    l++;
    printf("%d \n", m[i][j]);
}

    k1 = k;
    k1--;
    k1--;
    if (n % 2 == 0) {
        f = 1;
        i--;
        l++;
        printf("%d\n", m[i][j]);
    }

    while (k1 != 0) {
    if (f == 1) {
        if (k1 == 0) {
            break;
        }
        p = k1;
        while (p > 0) {
         // printf("cyc2down i = %d j = %d l = %d k1 = %d\n", i, j, l ,k1);
            i--; j++;  //вправо и вверх
            printf("%d \n", m[i][j]);
            l++;
            p--;
        }
        k1--;
        j--;
        l++;
        printf("%d\n", m[i][j]);
        if (k1 == 0) {
            break;
        }
        p = k1;
        while (p > 0) {
        //  printf("cyc1down i = %d j = %d l = %d k1 = %d\n", i, j, l ,k1);
            i++; j--;
            printf("%d \n", m[i][j]);
            l++;
            p--;
        }
        k1--;
        i--;
        l++;
        printf("%d\n", m[i][j]);
        if (k1 == 0) {
            break;
        }
    }
    if (n % 2 != 0  && f == 0) {
        j--;
        l++;
        printf("%d\n", m[i][j]);
        f = 1;
        p = k1;
        while (p > 0) {
        //  printf("cyc1downh i = %d j = %d l = %d k1 = %d\n", i, j, l ,k1);
            i++; j--;
            printf("%d \n", m[i][j]);
            l++;
            p--;
        }
        i--;
        l++;
        printf("%d\n", m[i][j]);
        k1--;
    }
}
}
}