#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <functional>

using namespace std;

int main()
{
	int N;
	vector<int> A;

	cin >> N;

	A.resize(N-1);

	for (int i = 0; i < N-1; i++)
	{
		cin >> A[i];
	}
	
	sort(A.begin(), A.end());
	int buf=1, count=0, couc = 0;

	for (int i = 0; i < N - 1; i++)
	{
		if (buf != A[i]) 
		{
			cout << count << endl;
			count = 1;
			couc++;
		}
		else
			count ++ ;

		if (i == N-2)
		{
			cout << count << endl;
			couc++;
		}

		buf = A[i];
	}
	for (int i = 0; i < N-couc; i++)
	{
		cout << 0 << endl;
	}

	return 0;
}