跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0993. Compote

  • ID: 999
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 数学
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 439 题。保留原作者与原赛事署名。