#include <bits/stdc++.h>
using namespace std;
const long long int INF = (1LL << 60) - 1;
const long long int MAX = 1000000001;
const long long int mod = 1000000007;
long long int s[1000001] = {0};
long long int f[1000001] = {0};
long long int po[1000001] = {0};
long long int fast_exp(long long int base, long long int exp, long long int m) {
  long long int res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) {
      res = (res * base) % m;
    }
    base = (base * base) % m;
    exp /= 2;
  }
  return res % m;
}
long long int gcd(int a, int b);
long long int power(long long int x, long long int y, long long int m);
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
long long int power(long long int x, long long int y, long long int m) {
  if (y == 0) return 1;
  long long int p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int a[6] = {0}, sum = 0;
  int freq[101] = {0};
  for (int i = 1; i <= 5; i++) {
    cin >> a[i];
    freq[a[i]]++;
    sum += a[i];
  }
  int temp1 = 0, temp2 = 0;
  for (int i = 1; i <= 100; i++) {
    if (freq[i] == 2)
      temp1 = freq[i] * i;
    else if (freq[i] >= 3)
      temp2 = 3 * i;
  }
  cout << min(sum - temp1, sum - temp2) << '\n';
  return 0;
}
