#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int** solution(int n, int* returnSize, int** returnColumnSizes) {
    *returnSize = n;
    *returnColumnSizes = (int*)malloc(n * sizeof(int));
    int** matrix = (int**)malloc(n * sizeof(int*));
    
    for (int i = 0; i < n; i++) {
        matrix[i] = (int*)malloc(n * sizeof(int));
        (*returnColumnSizes)[i] = n;
        memset(matrix[i], 0, n * sizeof(int));
    }
    
    int num = 1;
    
    for (int layer = 0; layer < (n + 1) / 2; layer++) {
        // Top row
        for (int col = layer; col < n - layer; col++) {
            matrix[layer][col] = num++;
        }
        
        // Right column
        for (int row = layer + 1; row < n - layer; row++) {
            matrix[row][n - 1 - layer] = num++;
        }
        
        // Bottom row (if more than one row in this layer)
        if (layer < n - 1 - layer) {
            for (int col = n - 2 - layer; col >= layer; col--) {
                matrix[n - 1 - layer][col] = num++;
            }
        }
        
        // Left column (if more than one column in this layer)
        if (layer < n - 1 - layer) {
            for (int row = n - 2 - layer; row > layer; row--) {
                matrix[row][layer] = num++;
            }
        }
    }
    
    return matrix;
}

int main() {
    int n;
    scanf("%d", &n);
    
    int returnSize;
    int* returnColumnSizes;
    int** result = solution(n, &returnSize, &returnColumnSizes);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("[");
        for (int j = 0; j < returnColumnSizes[i]; j++) {
            printf("%d", result[i][j]);
            if (j < returnColumnSizes[i] - 1) printf(",");
        }
        printf("]");
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    return 0;
}