From what I think is, CFL is closed under union so we have to look for components of the language, if they are all below or are CFL the language as a whole will be CFL.
e.g every string with length not equal to 4n would be part of the language, so a regular component.
Also all strings starting with (ww)' [CFL], ending with (ww)' [CFL] and containing (ww)' [CFL] and any component I'm missing, when we union all of them it'll come out to be CFL.