#include <iostream>
using namespace std;
int main()
{
	short a;
	cin >> a;
	a = 1000 - a;
	int b = 0;
	b += a / 500;
	a = a % 500;
	b += a / 100;
	a = a % 100;
	b += a / 50;
	a = a % 50;
	b += a / 10;
	a = a % 10;
	b += a / 5;
	a = a % 5;
	b += a / 1;
	a = a % 1;
	cout << b;
}

#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int, int> p;
int main()
{
	int a;
	cin >> a;
	p b[100001];
	for(int i = 0; i < a; i++)
	{
		cin >> b[i].second >> b[i].first;
	}
	sort(b, b+a);
	int c = 1;
	int l = b[0].first;
	for(int i = 1; i < a; i++)
	{
		if(b[i].second >= l)
		{
			l = b[i].first;
			c++;
		}
	}
	cout << c;
}

#include <iostream>
using namespace std;
int main()
{
	int n, k;
	cin >> n >> k;
	int v[11];
	for(int i = 0; i < n; i++)
	{
		cin >> v[i];
	}
	int g = 0;
	int j = n - 1;
	while(1)
	{
		if(k == 0)
		{
			break;
		}
		if(v[j] <= k)
		{
			g += k / v[j];
			k = k % v[j];
		}
		j--;
	}
	cout << g;
}

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	int time[1001];
	int a;
	cin >> a;
	for(int i = 0; i < a; i++)
		cin >> time[i];
	sort(time, time + a);
	long long b = 0;
	for(int i = 0; i < a; i++)
		for(int j = 0; j < i + 1; j++)
			b += time[j];
	cout << b;
}