If the alphabet is a set of integers, a string $W$ is called an additive square if $W = UV$, where $|U| = |V|$ and $\sum U[i] = \sum V[i]$. Given a length $N$ sequence composed of integers whose magnitude is $N^{O(1)}$, determine whether there is a substring (composed of consecutive letters) that is an additive square.