#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
int num[4],val[4];
int c1[8005],c2[8005],maxx;
int main()
{
    val[1]=1,val[2]=2,val[3]=5;
    while(scanf("%d%d%d",&num[1],&num[2],&num[3])!=EOF)
    {
        if(num[1]+num[2]+num[3]==0)
            break;
        maxx=num[1]+2*num[2]+5*num[3];
        memset(c1,0,sizeof(c1));
        memset(c2,0,sizeof(c2));
        for(int i=0;i<=num[1];i++)
            c1[i]=1;
        for(int i=2;i<=3;i++)
        {
            for(int j=0;j<=maxx;j++)
            {
                if(c1[j])
                {
                    for(int k=0;k<=val[i]*num[i];k+=val[i])
                    {
                        if(k+j<=maxx)
                            c2[k+j]+=c1[j];
                    }
                }
            }
            for(int j=0;j<=maxx;j++)
                c1[j]=c2[j],c2[j]=0;
        }
        int i;
        for(i=1;i<=maxx;i++)
        {
            if(c1[i]==0)
            {
                printf("%d\n",i);
                break;
            }
        }
        if(i==maxx+1)
            printf("%d\n",maxx+1);
    }
    return 0;
}