#273.2 C. Table Decorations(贪心)

You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if we know number of balloons of each color?

Your task is to write a program that for given values r, g and b will find the maximum number t of tables, that can be decorated in the required manner.

Input

The single line contains three integers r, g and b (0 ≤ r, g, b ≤ 2·10⁹) — the number of red, green and blue baloons respectively. The numbers are separated by exactly one space.

Output

Print a single integer t — the maximum number of tables that can be decorated in the required manner.

Sample test(s)

Input

5 4 3

Output

4

Input

1 1 1

Output

1

Input

2 3 3

Output

2

Note

In the first sample you can decorate the tables with the following balloon sets: "rgg", "gbb", "brr", "rrg", where "r", "g" and "b" represent the red, green and blue balls, respectively.

                                                            

题意：

有三种颜色的小球，每张桌子只能放3个，且小球颜色不能相同。求出最多放多少小球。

思路：

若小球数量最大值比另外小球数量和×2 大，则答案为另外小球数量；否则是总数量的平均值。

此思路举几个样例yy 一下。

CODE：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
long long a[3];
int main()
{
    //freopen("in", "r", stdin);
    while(~scanf("%I64d %I64d %I64d", &a[0], &a[1], &a[2])){
        sort(a, a + 3);
        if((a[0] + a[1]) * 2 <= a[2]) printf("%I64d\n", a[0] + a[1]);
        else{
            printf("%I64d\n", (a[0]+a[1]+a[2]) / 3);
        }
    }
}