C. Table Decorations



C. Table Decorations

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

三种不同颜色的气球，最大的气球数量的一半小于另外两种颜色的数量之和，就能组成   三份全部颜色数量之和   再除以三就是answer，

而在最大的气球数量的一半大于等于另外两种颜色的数量之和，全部组成为 2 + 1，颜色数量最大为2；

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
    long long color[3],ans = 0;

    cin>>color[0]>>color[1]>>color[2];

    sort(color,color+3);

    if((color[0]+color[1]) <= color[2] / 2)
    {
        ans = color[0]+color[1];
    }
    else
    {
        ans =(color[0]+color[1]+color[2]) / 3;
    }
    printf("%I64d\n",ans);
    return 0;
}