## Algorithm

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

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

int arr[3];

int main() {
scanf("%d%d%d", &arr[0], &arr[1], &arr[2]);
sort(arr, arr + 3);

if((1LL * arr[0] + arr[1] + arr[2]) / 3 > (1LL * arr[0] + arr[1]))
printf("%lld\n", 1LL * arr[0] + arr[1]);
else
printf("%lld\n", (1LL * arr[0] + arr[1] + arr[2]) / 3);

return 0;
}``````
Copy The Code &

Input

cmd
5 4 3

Output

cmd
4