Codeforces Round #386 (Div. 2) 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 exactly2 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 print0.

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

题意:小明有三种水果。柠檬，苹果，梨。这三个水果分别有a,b,c个。小明想用这些水果做果盘：一个果盘需要一个柠檬，两个苹果和4个梨。试问小明最多能用多少个水果做果盘？？

思路：。。。。。。。

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define M(a) memset(a,0,sizeof(a))
int main()
{
    int a,b,c;
    while(~scanf("%d %d %d",&a,&b,&c))
    {
        if(a<1||b<2||c<4)
        {
            printf("0\n");
            continue;
        }
        for(int i=1;i;i++)
        {
            if(i>a||2*i>b||i*4>c)
            {
                printf("%d\n",(i-1)+2*(i-1)+4*(i-1));
                break;
            }
        }
    }
    return 0;
}