Minimum in the Queue

Input

The input will be generated directly in your program. Parameters will be given to generate the input sequence.

The first number $n$ ( $1 \leq n \leq 1 0^{6}$ 1 \leq n \leq 10^6) is the number of operations to perform on the queue. Then four non-negative integers $a$ , $b$ , $c$ , $x_{0}$ x_0 are given, each not exceeding $10000$ .

To obtain the input sequence, generate the sequence $x$ .

The first number of the generated sequence is $x_{1}$ x_1. The first and each subsequent number is computed from the previous number as follows:

x_{i} = (a \cdot x_{i - 1} \cdot x_{i - 1} + b \cdot x_{i - 1} + c) /100 mod 1 0^{6},

x_i = (a \cdot x_{i-1} \cdot x_{i-1} + b \cdot x_{i-1} + c) / 100 \bmod 10^6,

where $/$ denotes integer division and $mod$ is the remainder after division.

If $x_{i} mod 5 < 2$ x_i \bmod 5 < 2, remove an element from the queue; otherwise, add $x_{i}$ x_i to the queue.

Output

Print the resulting sum.

Examples

Example 1

Loading

Example 5

Loading

Example 7

Loading