hdu 2021

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

const double inf=1e20;
const int maxn=2e5+10;
const int mod=1e9+7;

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0)break;
        int a;
        ll num=0;
        for(int i=0;i<n;i++){
            scanf("%d",&a);
            num+=a/100;
            a%=100;
            num+=a/50;
            a%=50;
            num+=a/10;
            a%=10;
            num+=a/5;
            a%=5;
            num+=a/2;
            a%=2;
            num+=a/1;
        }
        printf("%d\n",num);
    }
    return 0;
}