/*
   ACM North Central Region, 1993-94
   Problem A, Factorial Frequencies

   Ed Karrels, March 1996
*/

#include <stdio.h>

int main() {
   int digits[1000];
   int digit_counts[10] = {0};
   int n_digits, digit_no;
   int i, j;
   int n, overflow, prod;

   
   scanf("%d", &n);

   while (n) {
      digits[0] = 1;
      n_digits = 1;
      
      for (i=2; i<=n; i++) {
	 overflow = 0;
	 for (j=0; j<n_digits || overflow; j++) {
	    if (j<n_digits) {
	       digits[j] = digits[j] * i + overflow;
	    } else {
	       digits[j] = overflow;
	    }
	    overflow = digits[j] / 10;
	    digits[j] = digits[j] % 10;
	 }
	 n_digits = j;
	 
      }

      printf("%d! --\n", n);
      for (i=0; i<n_digits; i++) {
	 digit_counts[digits[i]]++;
      }
      for (i=0; i<10; i++) {
	 printf("   (%d)  %3d ", i, digit_counts[i]);
	 digit_counts[i] = 0;
	 if (i==4 || i==9) putchar('\n');
      }

/*
   Just as a check, print the actual number
   for (j=n_digits-1; j>=0; j--) {
      putchar('0'+digits[j]);
   } putchar('\n');
*/



      scanf("%d", &n);

   }

   return 0;
}