2008 xIMC keystage2-EMIC team Question 10

A frog starts at $0$ on a line and must reach $2008$ in exactly $19$ jumps of lengths $1^2,2^2,\ldots,19^2$ in order, choosing positive or negative direction each time. What is the earliest possible last negative jump?