Codeforces 322B

B. Ciel and Flowers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Fox Ciel has some flowers: r red flowers, g green flowers and b blue flowers. She wants to use these flowers to make several bouquets. There are 4 types of bouquets:

• To make a "red bouquet", it needs 3 red flowers.
• To make a "green bouquet", it needs 3 green flowers.
• To make a "blue bouquet", it needs 3 blue flowers.
• To make a "mixing bouquet", it needs 1 red, 1 green and 1 blue flower.

Help Fox Ciel to find the maximal number of bouquets she can make.

Input

The first line contains three integers r, g and b (0≤r,g,b≤109) — the number of red, green and blue flowers.

Output

Print the maximal number of bouquets Fox Ciel can make.

Sample test(s)

input

3 6 9

output

6

input

4 4 4

output

4

input

0 0 0

output

0

Note

In test case 1, we can make 1 red bouquet, 2 green bouquets and 3 blue bouquets.

In test case 2, we can make 1 red, 1 green, 1 blue and 1 mixing bouquet.

#include <iostream>

using namespace std;

int main()

{

    int r,b,g;

    int res=-1;

    cin>>r>>g>>b;

    for(int i=0;i<3;i++)

    {

        if(min(r,min(g,b))<i) continue;

        res=max(res,i+(r-i)/3+(g-i)/3+(b-i)/3);

    }

    cout<<res<<endl;

    return 0;

}