1154C Gourmet Cat

Polycarp has a cat and his cat is a real gourmet! Dependent on a day of the week he eats certain type of food:

• on Mondays, Thursdays and Sundays he eats fish food;
• on Tuesdays and Saturdays he eats rabbit stew;
• on other days of week he eats chicken stake.

Polycarp plans to go on a trip and already packed his backpack. His backpack contains:

• ?a daily rations of fish food;
• ?b daily rations of rabbit stew;
• ?c daily rations of chicken stakes.

Polycarp has to choose such day of the week to start his trip that his cat can eat without additional food purchases as long as possible. Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Input

The first line of the input contains three positive integers ?a, ?b and ?c (1≤?,?,?≤7⋅1081≤a,b,c≤7⋅108) — the number of daily rations of fish food, rabbit stew and chicken stakes in Polycarps backpack correspondingly.

Output

Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Examples

input

2 1 1
output
4
input
3 2 2
output
7
input
1 100 1
output
3
input
30 20 10
output
39

Note

In the first example the best day for start of the trip is Sunday. In this case, during Sunday and Monday the cat will eat fish food, during Tuesday — rabbit stew and during Wednesday — chicken stake. So, after four days of the trip all food will be eaten.

In the second example Polycarp can start his trip in any day of the week. In any case there are food supplies only for one week in Polycarps backpack.

In the third example Polycarp can start his trip in any day, excluding Wednesday, Saturday and Sunday. In this case, the cat will eat three different dishes in three days. Nevertheless that after three days of a trip there will be 9999 portions of rabbit stew in a backpack, can cannot eat anything in fourth day of a trip.

题意：你有只猫，周一、四、日吃鱼，周二、六吃兔肉。其余时间吃鸡肉。现在你要去旅行，且你准备了a份鱼、b份兔肉、c份鸡肉。求你在某天出门后这只猫能吃的的最大天数。

思路：先看满足几个完整的周。

1、枚举开始的星期几；

2、规律（这个天数跟你周几出门有关）

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define fori(a,b) for(int i=a;i<=b;i++)
#define forj(a,b) for(int j=a;j<=b;j++)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const int M=3e5+10;
const int MAX=1e18+10;
const double PI = acos(-1);
int main()
{
    int a,b,c,i,j,p,sum=0,ans=0,x,y,z;
    cin>>a>>b>>c;
    x=a/3;
    y=b/2;
    z=c/2;
    p=min(min(x,y),z);//满足最大的周数
    a-=3*p;
    b-=2*p;
    c-=2*p;
    ans=p*7;
    //现在a,b,c是单周的了
    int  ch[20]={0,1,2,3,1,3,2,1 ,1,2,3,1,3,2,1};
    x=a;y=b;z=c;
    int maxx=-1;
    for(i=1;i<=7;i++)//循环周几
    {
        x=a;y=b;z=c;sum=0;p=0;
        for(j=i;j<i+7;j++)
        {
            if(ch[j]==1)
            {
                x-=1;
                sum++;
            }
            if(x<0)
            {
                p=1;
                break;
            }
            if(ch[j]==2)
            {
                y-=1;
                sum++;
            }
            if(y<0)
            {
                p=1;
                break;
            }
            if(ch[j]==3)
            {
                z-=1;
                sum++;
            }
            if(z<0)
            {
                p=1;
                break;
            }
        }
        if(p=1)
            sum-=1;
        if(sum>=maxx)
            maxx=sum;
    }
    ans+=maxx;
    cout<<ans<<endl;
    return 0;
}