/*   @JUDGE_ID:   1705PZ   357   C */
#include <stdio.h>

int coins[] = {1, 5, 10, 25, 50};
int noc = sizeof(coins) / sizeof(int);
long long ways[5][30001];

long long count(int x, int max)
{
  int i, m;
  long long sum;

  if( x == 0 ) {
    return 1;
  }

  for( i = 0; i < noc; i++) {
    if( max == coins[i] ) {
      m = i;
      break;
    }
  }

  if( ways[m][x] != 0 ) {
    return ways[m][x];
  }

  for(i = 0, sum = 0; i < noc; i++) {
    if( coins[i] <= x && coins[i] <= max) {
      sum += count( x - coins[i], coins[i] );
    }
  }

  ways[m][x] = sum;

  return sum;
}

int main(){
  int i, j, num;
  long long answer;

  while(scanf("%d", &num) == 1){
    answer = count(num, 50);
    if(answer != 1)
      printf("There are %lld ways to produce %d cents change.\n", answer, num);
    else
      printf("There is only 1 way to produce %d cents change.\n", num);
  }
  return 0;
}