bright

# 5585
n = 1000- int(input())

cnt = 0 

while n :
  if n >= 500:
    n -= 500
    cnt += 1 
  elif n >= 100 : 
    cnt += int(n/100)
    n = n%100 
  elif n >= 50 : 
    cnt += int(n/50)
    n = n%50 
  elif n >= 10 : 
    cnt += int(n/10)
    n = n%10 
  elif n >= 5 : 
    cnt += int(n/5)
    n = n%5
  else : 
    cnt += 1
    n -= 1 

print(cnt)

# 11399
# 가장 적게 걸리는 사람이 가장 앞에 오기 

n = int(input())
p = list(map(int,input().split()))

p.sort()
sum=0
tmp=0 
for i in p:
  tmp = tmp + i
  sum = sum + tmp 

print (sum)

# 14241
n = str(input())
data = list(map(int, input().split()))

score = 0 
i=0
while i < len(data)-1:
  score = score + data[i]*data[i+1]
  data[i+1] = data[i]+ data[i+1]
  i = i +1 

print(score)

# 18238
tmp = input()
alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

cnt = 0 
now = alpha.index('A')

for i in tmp:
  start = alpha.index(i)
  if abs(start-now) > 12 :
    cnt = cnt+ 26 - abs(start-now)
  else:
    cnt = cnt + abs ( start-now )
  now = start

print (cnt) 

# 16208 
n = int(input())
a = list(map(int, input().split()))

# 최소 비용이 나오려면? 
# 항상 동일한 비용이 나옴.

cost = 0 
sum = 0 
l = len(a)

for i in a:
  sum = sum + i

for i in range(0, l-1):
  sum = sum - a[i]
  cost = cost + a[i]*sum 

print (cost)