// Memory   Time
// 1347K     0MS
// by : Snarl_jsb
// 2014-09-18-15.35
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<climits>
#include<cmath>
#define N 1000010
#define LL long long
using namespace std;

int cnt[4],c1[123456],c2[123456];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
//    freopen("C:\\Users\\ASUS\\Desktop\\cin.cpp","r",stdin);
//    freopen("C:\\Users\\ASUS\\Desktop\\cout.cpp","w",stdout);
    int val[4]={0,1,2,5};
    int x,y,z;
    while(cin>>x>>y>>z&&(x+y+z))
    {
        int sum=x+2*y+5*z;
        memset(c1,0,sizeof(c1));
        memset(c2,0,sizeof(c2));
        int cnt[4]={0,x,y,z};
        for(int i=0;i<=cnt[1];++i)
        {
            c1[i]=1;
        }
        for(int i=2;i<=3;++i)
        {
            for(int j=0;j<=sum;++j)
            {
                for(int k=0;k<=cnt[i];k++)
                    c2[k*val[i]+j]+=c1[j];
            }
            for(int j=0;j<=sum;++j)
            {
                c1[j]=c2[j];
                c2[j]=0;
            }
        }
        for(int i=1;i<=sum+1;++i)
            if(!c1[i])
            {
                cout<<i<<endl;
                break;
            }
    }
    return 0;
}