codeforces#386A 746A Compote

A. Compote

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Nikolay has a lemons, b apples and c pears. He decided to cook a compote. According to the recipe the fruits should be in the ratio1: 2: 4. It means that for each lemon in the compote should be exactly 2 apples and exactly 4 pears. You can't crumble up, break up or cut these fruits into pieces. These fruits — lemons, apples and pears — should be put in the compote as whole fruits.

Your task is to determine the maximum total number of lemons, apples and pears from which Nikolay can cook the compote. It is possible that Nikolay can't use any fruits, in this case print 0.

Input

The first line contains the positive integer a (1 ≤ a ≤ 1000) — the number of lemons Nikolay has.

The second line contains the positive integer b (1 ≤ b ≤ 1000) — the number of apples Nikolay has.

The third line contains the positive integer c (1 ≤ c ≤ 1000) — the number of pears Nikolay has.

Output

Print the maximum total number of lemons, apples and pears from which Nikolay can cook the compote.

Examples

input

2
5
7

output

7

input

4
7
13

output

21

input

2
3
2

output

0

Note

In the first example Nikolay can use 1 lemon, 2 apples and 4 pears, so the answer is 1 + 2 + 4 = 7.

In the second example Nikolay can use 3 lemons, 6 apples and 12 pears, so the answer is 3 + 6 + 12 = 21.

In the third example Nikolay don't have enough pears to cook any compote, so the answer is 0.

        题意：Nikolay有一些水果，其中a个柠檬，b个苹果，c个梨。现在Nikolay要用这些水果做几套拼盘，每套水果拼盘的柠檬、苹果、梨的使用比例是1:2:4,。现在问Nikolay最多可以做几套？？

      思路：算出分别算出用柠檬、苹果、梨最多可以做几套，最后取最小的即可。这个是比较典型的签到题。

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	int a,b,c;
	while(cin>>a>>b>>c){
		int Min=9000;  
//因为题中的数据规模并不大，所以这个的初始化成9000就够了。 
		Min=min(Min,a);
		Min=min(Min,b/2);
		Min=min(Min,c/4);
//通过这三个就是直接计算出最小的一个。 
		cout<<(Min+Min*2+Min*4)<<endl;
	}
}
 

       因为这个题比较简单，所以代码基本上都不长，C++的代码就没什么优化的空间的了。