#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
int a[100002], n;
long long cost[100002];
int findIndex(int v) {
  int idx = lower_bound(a + 1, a + 1 + n, v) - a;
  return idx - 1;
}
int main() {
  int test, cases = 1;
  scanf("%d", &n);
  for (int i = (1); i < (n + 1); i++) {
    scanf("%d", &a[i]);
  }
  cost[0] = 0;
  for (int i = (1); i < (n + 1); i++) {
    cost[i] = cost[i - 1] + 20;
    int idx = findIndex(a[i] - 89);
    cost[i] = min(cost[i], cost[idx] + 50);
    idx = findIndex(a[i] - 1439);
    cost[i] = min(cost[i], cost[idx] + 120);
    printf("%lld\n", cost[i] - cost[i - 1]);
  }
  return 0;
}
