Minimum in the Stack

Input

The input data is generated within your program. You are given parameters to generate the input sequence.

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

To obtain the sequence, generate the sequence $x$ as follows:

The first number in the sequence is $x_{0}$ x_0. Each next number is calculated from the previous one by the formula:

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

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

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

If $x_{i} mod 5 < 2$ x_i \bmod 5 < 2, remove a number from the stack. Otherwise, add $x_{i}$ x_i to the stack.

Output

Print the resulting sum.

Examples

Example 1

Loading

Example 2

Loading