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

A = {w | w = (000)ⁿ(111)ⁿ, n > 0}