Solution (source code)

= Solution

If $(a_n)$ is bounded, apply Bolzano–Weierstrass to $(\Re a_n,\Im a_n)$ (or successively to both coordinates). If it is unbounded, recursively choose $n_k\gt n_{k-1}$ with $|a_{n_k}|\ge k^2$. The alternatives are not exclusive: $0,1,0,4,0,9,\ldots$ has both kinds of subsequence.