#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
struct io {
  io() {
    ios::sync_with_stdio(false);
    cin.tie(0);
  }
};
const int INF = INT_MAX;
const long long int LLINF = 1LL << 60;
const long long int MOD = 1000000007;
const double EPS = 1e-19;
signed main() {
  vector<long long int> t(5);
  long long int m = 9;
  long long int sum = 0;
  for (long long int i = 0; i < (5); ++i) {
    cin >> t[i];
    if (t[i] % 10 != 0) {
      m = min(t[i] % 10, m);
      t[i] = t[i] + (10 - t[i] % 10);
    }
    sum += t[i];
  }
  sum -= (10 - m);
  cout << (sum) << endl;
}
