A10685 | Travel Card

A new innovative ticketing systems for public transport is introduced in Bytesburg. Now there is a single travel card for all transport. To make a trip a passenger scan his card and then he is charged according to the fare.

The fare is constructed in the following manner. There are three types of tickets:

1. a ticket for one trip costs $20$ byteland rubles,
2. a ticket for $90$ minutes costs $50$ byteland rubles,
3. a ticket for one day ( $1440$ minutes) costs $120$ byteland rubles.

Note that a ticket for $x$ minutes activated at time $t$ can be used for trips started in time range from $t$ to $t+x-1$ , inclusive. Assume that all trips take exactly one minute.

To simplify the choice for the passenger, the system automatically chooses the optimal tickets. After each trip starts, the system analyses all the previous trips and the current trip and chooses a set of tickets for these trips with a minimum total cost. Let the minimum total cost of tickets to cover all trips from the first to the current is $a$ , and the total sum charged before is $b$ . Then the system charges the passenger the sum $a-b$ .

You have to write a program that, for given trips made by a passenger, calculates the sum the passenger is charged after each trip.

The first line of input contains integer number $n$ ( $1<=n<=10^{5}$ ) — the number of trips made by passenger.

Each of the following $n$ lines contains the time of trip $t_{i}$ ( $0<=t_{i}<=10^{9}$ ), measured in minutes from the time of starting the system. All $t_{i}$ are different, given in ascending order, i. e. $t_{i+1}>t_{i}$ holds for all $1<=i<n$ .

Output $n$ integers. For each trip, print the sum the passenger is charged after it.