I'm trying to understand how to use a contradiction proof via the Pumping Lemma to prove a language is not regular. Everybody always uses examples like $\{ 0^n1^n | n>=0\}$, where it can be broken up into two parts $xyz$ and where these parts are different. How can I apply it to a language consisting of the concatenation of 3 identical strings?