CMO 1995 Problem 4

Let $n$ be a constant positive integer. Show that for only non-negative integers $k$ , the Diophantine equation $\sum_{i=1 }^{n}{ x_i ^3}=y^{3k+2}$ has infinitely many solutions in the positive integers $x_i, y$ .