[ALGORISM] poj 3085

//2011 07 06
//poj 3085
//daun
#include <iostream>
using namespace std;

int main()
{
 int QUARTER =0 , DIME = 0, NICKEL = 0, PENNY = 0 ;
 int count = 0;
 int money = 0;
cin >> count;
 for(int i = 1 ; i<=count; i++)
 {
  cin >> money;
  QUARTER = money/25;
  money -= QUARTER * 25;
  DIME = money/10;
  money -= DIME * 10;
  NICKEL = money/5;
  money -= NICKEL * 5;
  PENNY = money/1;
  
  cout << i<<" "<<QUARTER<<" QUARTER(S), "<< DIME <<" DIME(S), "<<NICKEL<<" NICKEL(S), "<<PENNY<<" PENNY(S)"<<endl;

 }

 return 0;
}