CodeForces 90A Cableway【】

Cableway

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 90A

Description

A group of university students wants to get to the top of a mountain to have a picnic there. For that they decided to use a cableway.

A cableway is represented by some cablecars, hanged onto some cable stations by a cable. A cable is scrolled cyclically between the first and the last cable stations (the first of them is located at the bottom of the mountain and the last one is located at the top). As the cable moves, the cablecar attached to it move as well.

The number of cablecars is divisible by three and they are painted three colors: red, green and blue, in such manner that after each red cablecar goes a green one, after each green cablecar goes a blue one and after each blue cablecar goes a red one. Each cablecar can transport no more than two people, the cablecars arrive with the periodicity of one minute (i. e. every minute) and it takes exactly 30minutes for a cablecar to get to the top.

All students are divided into three groups: r of them like to ascend only in the red cablecars, g of them prefer only the green ones and bof them prefer only the blue ones. A student never gets on a cablecar painted a color that he doesn't like,

The first cablecar to arrive (at the moment of time 0) is painted red. Determine the least time it will take all students to ascend to the mountain top.

Input

The first line contains three integers r, g and b (0 ≤ r, g, b ≤ 100). It is guaranteed that r + g + b > 0, it means that the group consists of at least one student.

Output

Print a single number — the minimal time the students need for the whole group to ascend to the top of the mountain.

Sample Input

Input

1 3 2

Output

34

Input

3 2 1

Output

33

Hint

Let's analyze the first sample.

At the moment of time 0 a red cablecar comes and one student from the r group get on it and ascends to the top at the moment of time30.

At the moment of time 1 a green cablecar arrives and two students from the g group get on it; they get to the top at the moment of time31.

At the moment of time 2 comes the blue cablecar and two students from the b group get on it. They ascend to the top at the moment of time 32.

At the moment of time 3 a red cablecar arrives but the only student who is left doesn't like red and the cablecar leaves empty.

At the moment of time 4 a green cablecar arrives and one student from the g group gets on it. He ascends to top at the moment of time34.

Thus, all the students are on the top, overall the ascension took exactly 34 minutes.

啊。。。不解释啦。。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long LL;
const int INF=0x7ffffff;
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
const int maxn = 100005;
const int MAX = 0x3f3f3f3f;

int main()
{
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
        int num[3];
        if(a>2)num[0]=(a/2+a%2-1)*3;
        else num[0]=0;
        if(b>2)num[1]=(b/2+b%2-1)*3+1;
        else {
                if(b==0)num[1]=0;
                else num[1]=1;
        }
        if(c>2)num[2]=(c/2+c%2-1)*3+2;
        else {
                if(c==0)num[2]=0;
        else num[2]=2;
        }
        sort(num,num+3);
        printf("%d\n",30+num[2]);
    return 0;
}