Constructing a grammar for language of all squared words

Question

I need help in constructing a grammar for this language: $L = \{ \alpha \in \{a\}^* \mid \alpha = a^{n^2}, n \in \mathbb{N}_0\}$

All I can tell about $L$ is that it should be at least context-free.

Thanks in advance.