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

   Ed Karrels, April 1998
*/

import ContestSolution;
import java.io.*;

public class acmreg93a implements ContestSolution {
    public static void main(String[] args) {
	acmreg93a soln = new acmreg93a();
	soln.do_it(System.in, System.out);
    }

    public void do_it(InputStream input, PrintStream output) {
	MyBigNum bignum = new MyBigNum(10000);
	int factorial;
	int[] digit_counts = new int[10];

	StreamTokenizer token_input = new StreamTokenizer(input);

	factorial = read_int(token_input);

	while (factorial != 0) {

		// clear the big number
	    bignum.init();

		// compute the factorial
	    int i;
	    for (i=2; i<=factorial; i++) {
		bignum.multiply(i);
	    }

		// count the digits
	    for (i=0; i<bignum.n_digits; i++) {
		digit_counts[bignum.digits[i]]++;
	    }

		// write out the result
	    output.println("" + factorial + "! --");
	    for (i=0; i<10; i++) {
		output.print("   (" + i + ")");
		output.print(str_lpad("" + digit_counts[i], 5) + " ");
		if (i == 4 || i == 9) output.println("");
		digit_counts[i] = 0;
	    }

	    factorial = read_int(token_input);
	}
    }	

	// read an integer from the given StreamTokenizer
    int read_int(StreamTokenizer st) {
	try {
	    st.nextToken();
	    if (st.ttype != StreamTokenizer.TT_NUMBER) st.nval = 0;

	} catch (IOException e) {
	    st.nval = 0;
	}
	return (int)st.nval;
    }

	// pad a string with spaces on the left
    static String str_lpad(String s, int len) {
	int more = len - s.length();
	while (more > 0) {
	    s = " " + s;
	    more--;
	}
	return s;
    }

}


class MyBigNum {
    public int[] digits;
    public int n_digits;

    public MyBigNum(int n_digits) {
	digits = new int[n_digits];
	init();
    }
    
    public void init() {
	n_digits = 1;
	digits[0] = 1;
    }

    public void multiply(int fact) {
	int prod, carry=0, digitno=0;

	while (carry != 0 || digitno < n_digits) {
	    if (digitno >= n_digits)
		digits[digitno] = 0;
	    
	    prod = digits[digitno] * fact + carry;
	    digits[digitno] = prod % 10;
	    carry = prod / 10;
	    digitno++;
	}
	n_digits = digitno;
    }
}