문제<\/h2>
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.<\/p>
Let $V<\/mi><\/mrow>V<\/math><\/span><\/span> V<\/span><\/span><\/span><\/span> be a set of integers, initially empty. We are given the starting value of the integer s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span>. Make n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> steps described below:<\/p> s<\/mi>\leftarrow<\/mo>(<\/mo>s<\/mi>\cdot<\/mo>618<\/mn><\/mtext>023<\/mn>+<\/mo>1<\/mn>)<\/mo><\/mtext><\/mo><\/mtext>999<\/mn><\/mtext>983<\/mn><\/mrow>s \leftarrow (s \cdot 618\,023 + 1) \bmod 999\,983<\/math><\/span><\/span> find the number of distinct pairs of integers in V<\/mi><\/mrow>V<\/math><\/span><\/span> V<\/span><\/span><\/span><\/span> that have the sum s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span>;<\/li> if this number is even, insert s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span> into the set V<\/mi><\/mrow>V<\/math><\/span><\/span> V<\/span><\/span><\/span><\/span>.<\/li>
<\/ul> How many elements will there be in V<\/mi><\/mrow>V<\/math><\/span>$

Sums of Two