链接：https://codeforces.com/problemset/problem/478/C

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·109) — 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.

Examples

input

Copy

5 4 3

output

Copy

4

input

Copy

1 1 1

output

Copy

1

input

Copy

2 3 3

output

Copy

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.

代码：

#include<bits/stdc++.h>
using namespace std;
long long n,s,t,b,k,c,l,r,d,ans,min1=0,mod=1e9+7;
long long a[10];
int main()
{
    cin>>a[1]>>a[2]>>a[3];
    sort(a+1,a+4);
    k=a[1]+a[2];
    if((a[1]+a[2]+a[3])/3<=k)
    cout<<(a[1]+a[2]+a[3])/3;
    else
    cout<<k;
}