Maximum Gift Bundles

You are given the number of teddy bears, toy cars, and dolls available, denoted by t, c, and d respectively. Each gift bundle requires exactly $$2$$ teddy bears, $$1$$ toy car, and $$1$$ doll. Your task is to compute the maximum number of complete gift bundles that can be formed.

In other words, if a single bundle is formed using the resources, you must satisfy the conditions:

• $$t \ge 2 \times B$$
• $$c \ge B$$
• $$d \ge B$$

where $$B$$ is the number of bundles. Find the maximum possible value of $$B$$.

inputFormat

The input contains a single line with three space-separated integers: t, c, and d representing the number of teddy bears, toy cars, and dolls respectively.

outputFormat

Output a single integer which is the maximum number of gift bundles that can be formed.

10 5 2

2