#include <bits/stdc++.h>
using namespace std;
template <class T>
void cou(vector<vector<T>> a) {
  long long b = a.size();
  long long c = a[0].size();
  for (long long i = 0; i < b; i++) {
    for (long long j = 0; j < c; j++) {
      cout << a[i][j];
      if (j == c - 1)
        cout << endl;
      else
        cout << ' ';
    }
  }
}
long long wari(long long a, long long b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
long long keta(long long a) {
  double b = a;
  b = log10(b);
  long long c = b;
  return c + 1;
}
long long souwa(long long a) { return a * (a + 1) / 2; }
bool prime(long long a) {
  if (a < 2)
    return false;
  else if (a == 2)
    return true;
  else if (a % 2 == 0)
    return false;
  double b = sqrt(a);
  for (long long i = 3; i <= b; i += 2) {
    if (a % i == 0) {
      return false;
    }
  }
  return true;
}
struct Union {
  vector<long long> par;
  Union(long long a) { par = vector<long long>(a, -1); }
  long long find(long long a) {
    if (par[a] < 0)
      return a;
    else
      return par[a] = find(par[a]);
  }
  bool same(long long a, long long b) { return find(a) == find(b); }
  long long Size(long long a) { return -par[find(a)]; }
  void unite(long long a, long long b) {
    a = find(a);
    b = find(b);
    if (a == b) return;
    if (Size(b) > Size(a)) swap<long long>(a, b);
    par[a] += par[b];
    par[b] = a;
  }
};
long long ketas(long long a) {
  string b = to_string(a);
  long long c = 0;
  for (long long i = 0; i < keta(a); i++) {
    c += b[i] - '0';
  }
  return c;
}
long long gcm(long long a, long long b) {
  if (b == 0) return a;
  return gcm(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcm(a, b) * b; }
bool fe(long long a, long long b) {
  a /= 10;
  b /= 10;
  if (a == 0) a = 10;
  if (b == 0) b = 10;
  if (a < b)
    return true;
  else
    return false;
}
signed main() {
  vector<long long> a(5);
  for (long long i = 0; i < 5; i++) cin >> a[i];
  sort(a.begin(), a.end(), fe);
  long long b = 0;
  for (long long i = 0; i < 4; i++) {
    if (a[i] % 10 == 0)
      b += a[i];
    else
      b += (a[i] / 10 + 1) * 10;
  }
  cout << b + a[4] << endl;
}
