Prove that a language is not regular


Prove that the following language $ Σ = \{{1^3}^n\}$ where $ n \geq 0$ is not regular.

How should one go about proving this? Should I use pumping lemma for this?