Wind me a number snake! Given an input integer n, draw a number snake, that is, a grid measuring n x n consisting of the numbers 1 through n^2 that are wound around each other in the following fashion:

Input n = 3:

7 8 9
6 1 2
5 4 3


Input n = 4:

 7  8  9 10
 6  1  2 11
 5  4  3 12
16 15 14 13


Input n = 5:

21 22 23 24 25
20  7  8  9 10
19  6  1  2 11
18  5  4  3 12
17 16 15 14 13


(Inspired by this problem from Project Euler.)

This is code-golf, the shortest answer in bytes wins!
MATL, 3 bytes

1YL


Try it online!

Explanation

Built-in... ¯\_(ツ)_/¯