# Prove that language is not context free

Could you give me any tip (not a solution) how to prove that the language of even length words over the alphabet $\{ 0, 1 \}$ such that the number of $1$ in the first half is equal or greater than the number of $1$ in the second half is not context free?

Hint. Once the pumping lemma gives you a pumping length $p$, ask it to slice up the word $\mathtt 0^p\mathtt 1^p\mathtt 0^p\mathtt 1^p$.