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

using namespace std;

int main() {
	int l, m, n;

	cin >> l >> m >> n;
	int total = l * 100 + m * 25 + n;
	total %= 1000;

	vector<int> dp(total + 1 + 100, 1e8);
	dp[0] = 0;

	for (int i = 0; i <= total; i++) {
		dp[i+1] = min(dp[i+1], dp[i] + 1);
		dp[i+25] = min(dp[i+25], dp[i] + 1);
		dp[i+100] = min(dp[i+100], dp[i] + 1);
	}
	cout << dp[total] << endl;
	return 0;
}