Lina the Magician claims that a common modern computer
can easily perform a hundred billion operations per second!
To prove it, she proposes to run the following calculations.

Let $V$ be a set of integers, initially empty.
We are given the starting value of the integer $s$.
Make $n$ steps described below:

\begin{itemize}
\item $s \leftarrow (s \cdot 618\,023 + 1) \bmod 999\,983$;
\item find the number of distinct pairs of integers in $V$
that have the sum $s$;
\item if this number is even, insert $s$ into the set $V$.
\end{itemize}

How many elements will there be in $V$ after $n$ steps?

Formally: on each step, we count the number of pairs $(a, b)$
where $a \in V$, $b \in V$, $a \le b$ and $a + b = s$.
