#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <climits>
#include <numeric>
#include <iterator>
#include <cmath>
#include <set>
#include <bitset>
#include <cassert>
using namespace std;

namespace Estd {
	// return 1's position (...3210) by given bs;
	// invarient: bs.count() == 1;
	// ex: 0000100 -> 2
	template<size_t N>
	constexpr size_t position(const bitset<N> bs) {
		assert(bs.count() == 1);
		for (int i = 0; i < N; ++i) {
			if (bs[i] == 1)
				return i;
		}
		throw;
	}
};

void solve() {
	vector<int> mon {100, 25, 1};

	int m {0};
	for (auto d : mon) {
		int x;
		cin >> x;
		m += d * x;
	}

	int ans {0};
	m %= 1000;
	for (auto d : mon) {
		ans += m / d;
		m %= d;
	}

	cout << ans << endl;
}

int main() {
	solve();
	return 0;
}