Program change;
Const
  p:array[1..4] of word=(1,5,10,25);
Type 
  So=Array[1..4]of Word;
Var
  Gia:word;
  max,dem:word;
  Soluong,luu:So;
  C:array[1..4] of word;
Procedure Tinh(n:byte);  
  Var i,m:Word;
  Begin
    m:=trunc(gia/p[n]);
    If m > C[n] Then m:=C[n];
    For i:=m downto 0 do   
      Begin
        dem:=dem+i;
        Gia:=Gia-i*p[n];
	Soluong[n]:=i;
	If (n<4) Then Tinh(n+1) Else
	If (Gia=0)And(Max<=dem) Then
	      Begin
	        max:=dem;
		luu:=soluong;
	      End;
	Dem:=Dem-i;
	Gia:=Gia+i*p[n];
      End;
  End;
Begin
  While Not Eof do
    Begin      
      Readln(gia,c[1],c[2],c[3],c[4]);
      If ((gia=0)and(c[1]=0)and(c[2]=0)and(c[3]=0)And(c[4]=0))  Then exit;
      dem:=0;max:=0; 
      Tinh(1);
      If max=0 Then Writeln('Charlie cannot buy coffee.') Else
        Begin	  
	  Writeln('Throw in ',luu[1],' cents, ',luu[2],' nickels, ',luu[3],' dimes, and ',luu[4],' quaters.');
	End;     	      
    End;
End.