#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define FOE(i,a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define EXIST(v, n) (std::find(v.begin(), v.end(), 1) != v.end())

using namespace std;

int main(int argc, char *argv[]) {
    int L, M, N;
    cin >> L >> M >> N;
    L *= 100; M *= 25;
    int v[] = { N, M, L };
    int coins[] = { 1, 25, 100, 1000 };

    int ans = 0, inc_c = 0;
    REP(i, 3) {
        int money = v[i] + inc_c * coins[i];
        inc_c = money / coins[i + 1]; 
        money -= inc_c * coins[i + 1];
        ans += money / coins[i];
    }
    cout << ans << endl;

}