#include <bits/stdc++.h>
using namespace std;
const long long llInf = 1e18 + 1e17;
const int Inf = 1e9 + 1e8, N = 1e5 + 10, Mod = 1e9 + 7;
int dp[N], t[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> t[i];
    int ind2 = upper_bound(t + 1, t + i, t[i] - 90) - t - 1,
        ind3 = upper_bound(t + 1, t + i, t[i] - 1440) - t - 1;
    int val1 = dp[i - 1] + 20;
    dp[i] = val1;
    int val2 = dp[ind2] + 50, val3 = dp[ind3] + 120;
    dp[i] = min({dp[i], val2, val3});
  }
  for (int i = 1; i <= n; i++) cout << dp[i] - dp[i - 1] << endl;
}
