#lang racket

(define (read-int n)
  (if (zero? n)
      null
      (cons (- (read) 1) (read-int (- n 1)))))

(define (solve N A)
  (let ([bukas (make-vector N 0)])
    (define (iter a)
      (if (null? a)
          bukas
         (begin (vector-set! bukas
                             (car a)
                             (+ (vector-ref bukas (car a)) 1))
                (iter (cdr a)))))
    (iter A)))
    
(define (print items sep)
  (define (iter items)
    (if (null? items)
        (newline)
        (begin
          (display (car items))
          (display sep)
          (iter (cdr items)))))
  (iter items))

(let* ([N (read)]
       [A (read-int (- N 1))])
  (print (vector->list (solve N A)) "\n"))
  
