跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2389. Ciel and Flowers

    ID: 2395 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 4 上传者: 标签>组合数学数学进阶难度共享题库Codeforces英文题面题目来源题面语言

Ciel and Flowers

题目描述

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.

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2016 题。保留原作者与原赛事署名。