No tag edit access

A. Compote

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputNikolay 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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/17/2017 23:43:34 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|