// Saint Bonaventure University Programming Contest
// February 15, 2008

// Problem #5 - Benford's Distribution
// Team Name: SOLUTION

#include <iostream>
using namespace std;

#include "apstring.h"
#include "apvector.h"

int main(void) {
	apvector<int> counts(10,0);
	int items = 0;
	apstring input;
	cin >> input;
	while (input[0] != '-') {
		int firstDigit = ((int) input[0]-'0');
		counts[firstDigit]++;
		items++;
		cin >> input;
	}
	
	for (int j=0; j<10; j++) {
		int percent = (int) (0.5 + 100.0*counts[j]/items);
		cout << percent << " ";
	}
	cout << endl;
	return EXIT_SUCCESS;
}