cf386 div2 A. Compote

A. Compote

time limit per test

memory limit per test

input

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 ratio 1: 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.

---

题目大意：给你柠檬、苹果、梨的数量a, b, c（每个水果都是整个的），这三种水果按照1:2:4的比例进行配置，问从给出的数据中最多能用多少水果按照这个比例来配置这个汤，输出最后的水果的总数（题意表达得不是很清楚，不要介意啊）

---

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main(){
    int a, b, c;
    cin >> a >> b >> c;
    int sum1 = a / 1;
    int sum2 = b / 2;
    int sum3 = c / 4;
    cout << min(min(sum1, sum2), sum3) * 7 << endl;
    return 0;
}