# Queue Data Structure

# Minimum in the Queue

The input to a program is a set of operations with the queue. Each operation is either addition or removal of an item to or from the queue. After each operation find the smallest among all the numbers in a queue. Add up all the resulting numbers and get an answer. If after any operation the queue is empty, then add nothing to the answer. If it is impossible to remove an item because the queue is empty, then do nothing.

## Input data

The input data will be generated in your program. You will be given some parameters to get the input sequence.

The first input number n (1 ≤ n ≤ `10^6`

) is the number of operations with the queue. Then four nonnegative integers a, b, c, `x[0]`

are given. Their values are not greater than 10000.

Let's generate the input sequence `x`

.

The first number of input sequence is `x[1]`

. The first and each next number can be evaluated from the previous number using the formula:

`x[i]`

= (a * `x[i-1]`

* `x[i-1]`

+ b * `x[i-1]`

+ c) / 100 mod `10^6`

,

where "/" is an integer division, 'mod' is the remainder from division.

If `x[i]`

mod 5 < 2, you must delete the number from the queue, otherwise add number `x[i]`

to the queue.

## Output data

Print the resulting sum.

## Examples

2 0 0 1 81

0

7 2 1 176 36

60

9 5 6 777 30

2165995