Let $n$ be an integer. Dayang are given $n$ sticks of lengths $1,2, 3,..., n$. She may connect the sticks at their ends to form longer sticks, but cannot cut them. She wants to use all these sticks to form a square. For example, for $n = 8$, she can make a square of side length $9$ using these connected sticks: $1 + 8$, $2 + 7$, $3 + 6$, and $4 + 5$. How many values of $n$, with $1 \le n \le 2018$, that allow her to do this?