C

Description

A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer.

Limak can discard (throw out) some cards. His goal is to minimize the sum of numbers written on remaining (not discarded) cards.

He is allowed to at most once discard two or three cards with the same number. Of course, he won't discard cards if it's impossible to choose two or three cards with the same number.

Given five numbers written on cards, cay you find the minimum sum of numbers on remaining cards?

Input

The only line of the input contains five integers t₁, t₂, t₃, t₄ and t₅ (1 ≤ t_i ≤ 100) — numbers written on cards.

Output

Print the minimum possible sum of numbers written on remaining cards.

Sample Input

Input

7 3 7 3 20

Output

26

Input

7 9 3 1 8

Output

28

Input

10 10 10 10 10

Output

20

题意：共有5张卡，可将两张或三张重复卡片扔掉，求扔掉后和的最小值。

排序后找到最大重复卡片和减掉即可。

附AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

int a[6];
int main(){
    for(int i=0;i<5;i++){
        cin>>a[i];
    }
    sort(a,a+5);
    int ans=2,Max=0,sum=0;
    for(int i=0;i<5;i++){
        if(a[i]==a[i+1]){
            if(ans<=3)//最多扔三张 
            Max=max(Max,a[i]*ans);
            ans++;
        }
        else
        ans=2;
    }
    for(int i=0;i<5;i++){
        sum+=a[i];
    }
    cout<<sum-Max<<endl;
    return 0;
}