Use pumping lemma to prove that the language is regular or not.

A = {w | w = (101)ⁿ, n > 2}