use std::collections::VecDeque;

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: isize = n.trim().parse().unwrap();

    let mut dir: VecDeque<_> = [(0, 1), (-1, 0), (0, -1), (1, 0)].iter().collect();

    let mut grid = vec![vec![0; n as usize]; n as usize];
    let mut p = (0, 0);

    for i in 1..=(n * n) {
        grid[p.0 as usize][p.1 as usize] = i;
        loop {
            let np = (p.0 + dir[0].0, p.1 + dir[0].1);
            if i == n * n
                || ((0isize..n).contains(&np.0)
                    && (0isize..n).contains(&np.1)
                    && grid[np.0 as usize][np.1 as usize] == 0)
            {
                p = np;
                break;
            }
            let d = dir.pop_front().unwrap();
            dir.push_back(d);
        }
    }

    for row in &grid {
        for (i, n) in row.iter().enumerate() {
            print!("{}{n:03}", if i == 0 { "" } else { " " });
        }
        println!();
    }
}