#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>

#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)

using namespace std;
typedef long long ll;


int main()
{
	
	int l,m,n;
	cin >>l >>m >>n;
	ll sm = 100 * l + 25 * m +  1 * n;
	sm %= 1000;
	int sh[3]={1,25,100};
	vector<int> cp(sm+4,999999);
	cp[0]=0;
	rep(i,sm+1) if(cp[i]<999999) rep(j,3){
		if(i+sh[j] < sm+1) cp[i+sh[j]] = min(cp[i+sh[j]] , cp[i] + 1);
	}
	cout << cp[sm] << endl;
	return 0;
}