A - 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.

Example

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.

这个题目意思就是让你从三种颜色气球中每次拿出三个气球，但要满足这三个气球不是同一种颜色，问你最多能几次。

这题满足这个公式：

a b c 三种气球数量，满足a<=b<=c

if   （a+b）*2<=c时：s=a+b;

else   s=(a+b+c)/3;

最好用long long ，而不是int

 

#include<stdio.h>
#include<algorithm>
#include<iostream>

using namespace std;

int main()
{
    long long a[3];
    long long s=0;
    scanf("%I64d %I64d %I64d",&a[0],&a[1],&a[2]);
    sort(a,a+3);
    if((a[0]+a[1])*2<=a[2])
        s=a[0]+a[1];
    else
        s=(a[0]+a[1]+a[2])/3;
    printf("%I64d",s);
    return 0;
}