import java.util.*;
import java.io.*;



public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    }

    static int MOD=1000000007;
    public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
}


class FastReader{ 
    BufferedReader br; 
    StringTokenizer st; 

    public FastReader(){ 
        br = new BufferedReader(new
                 InputStreamReader(System.in)); 
    } 
  
    String next(){ 
        while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } 
  
    int nextInt(){ 
        return Integer.parseInt(next()); 
    } 
  
    long nextLong(){ 
        return Long.parseLong(next()); 
    }
  
    double nextDouble(){ 
        return Double.parseDouble(next()); 
    }
  
    String nextLine(){ 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        }
        return str; 
    }
} Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        } public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            } compare { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            } if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; entry1[col] > entry2[col] entry1[col] entry1 col entry2[col] entry2 col return 1; 1 if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; entry1[col]==entry2[col] entry1[col] entry1 col entry2[col] entry2 col return 0; 0 return -1; -1 1 final int[] entry1 entry1 final int[] entry2 entry2 import java.util.*; util.* java import java.io.*; io.* java public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    }

    static int MOD=1000000007;
    public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
} Main static long m=998244353l;                   //line 156 modInverse m 998244353l static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd vis static int MOD=1000000007; MOD 1000000007 public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    } main {
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    } int MAX=1000000007; MAX 1000000007 FastReader sc=new FastReader(); sc new FastReader() OutputStream out=new BufferedOutputStream(System.out); out new BufferedOutputStream(System.out) int n=sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] a=new int[n]; a new int[n] n for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        } int i=1; int i=1; i 1 i<n i n i++ i++ i {
            int alpha=sc.nextInt();
            a[alpha-1]++;
        } {
            int alpha=sc.nextInt();
            a[alpha-1]++;
        } int alpha=sc.nextInt(); alpha sc.nextInt() sc.nextInt sc a[alpha-1]++ a[alpha-1] a alpha-1 alpha 1 for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            out.write((a[i]+"\n").getBytes());
        } {
            out.write((a[i]+"\n").getBytes());
        } out.write((a[i]+"\n").getBytes()) out.write out (a[i]+"\n").getBytes() (a[i]+"\n").getBytes (a[i]+"\n") a[i] a i "\n" out.flush() out.flush out String[] args args public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    } pow {                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    } if(k==1){
            return n%MOD;
        } k==1 k 1 {
            return n%MOD;
        } return n%MOD; n%MOD n MOD if(k==0){
            return 1;
        } k==0 k 0 {
            return 1;
        } return 1; 1 int val=pow(n,k/2)%MOD; val pow(n,k/2)%MOD pow(n,k/2) pow n k/2 k 2 MOD if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD; k%2==0 k%2 k 2 0 return (val*val)%MOD; (val*val)%MOD (val*val) val val MOD return (val*val*n)%MOD; (val*val*n)%MOD (val*val*n) val*val*n val val n MOD int n n int k k public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    } cnt_sum_k_subar {
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    } HashMap<Long,Long> map=new HashMap<Long,Long>(); map new HashMap<Long,Long>() long ret=0; ret 0 long cur_sum=0; cur_sum 0 for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        } {
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        } cur_sum+=a[i] cur_sum a[i] a i if(cur_sum==k){
                ret++;
            } cur_sum==k cur_sum k {
                ret++;
            } ret++ ret if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            } map.containsKey(cur_sum-k) map.containsKey map cur_sum-k cur_sum k {
                ret+=map.get(cur_sum-k);
            } ret+=map.get(cur_sum-k) ret map.get(cur_sum-k) map.get map cur_sum-k cur_sum k if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            } map.containsKey(cur_sum) map.containsKey map cur_sum {
                map.put(cur_sum, map.get(cur_sum)+1);
            } map.put(cur_sum, map.get(cur_sum)+1) map.put map cur_sum map.get(cur_sum)+1 map.get(cur_sum) map.get map cur_sum 1 {
                map.put(cur_sum, (long)1);
            } map.put(cur_sum, (long)1) map.put map cur_sum (long)1 return ret; ret long[] a a int n n int k k public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    } lcm {
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    } ArrayList<Integer> arrl=new ArrayList<Integer>(); arrl new ArrayList<Integer>() while(num%2==0){
            arrl.add(2);
            num/=2;
        } num%2==0 num%2 num 2 0 {
            arrl.add(2);
            num/=2;
        } arrl.add(2) arrl.add arrl 2 num/=2 num 2 for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        } int i=3; int i=3; i 3 i*i<=num i*i i i num i+=2 i+=2 i 2 {
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        } {
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        } while(num%i==0){
                arrl.add(i);
                num/=i;
            } num%i==0 num%i num i 0 {
                arrl.add(i);
                num/=i;
            } arrl.add(i) arrl.add arrl i num/=i num i if(num>2){
            arrl.add(num);
        } num>2 num 2 {
            arrl.add(num);
        } arrl.add(num) arrl.add arrl num return arrl; arrl int num num static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } modInverse { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } long m0 = m; m0 m long y = 0l y 0l x = 1l; x 1l if (m == 1) 
            return 0l; m == 1 m 1 return 0l; 0l while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } a > 1 a 1 { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } long q = a / m; q a / m a m long t = m; t m m = a % m m a % m a m a = t a t t = y t y y = x - q * y y x - q * y x q * y q y x = t x t if (x < 0) 
            x += m0; x < 0 x 0 x += m0 x m0 return x; x long a a long m m public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    } arr_fact {
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    } TreeSet<Long> arr=new TreeSet<Long>(); arr new TreeSet<Long>() int cnt=0; cnt 0 for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        } long i=1; long i=1; i 1 i*i<=num i*i i i num i++ i++ i {
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        } {
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        } if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            } num%i==0 num%i num i 0 {
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            } if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                } i*i==num i*i i i num {
                    cnt+=1;
                    arr.add(i);
                } cnt+=1 cnt 1 arr.add(i) arr.add arr i {
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                } arr.add(i) arr.add arr i arr.add(num/i) arr.add arr num/i num i cnt+=2 cnt 2 return arr; arr long num num public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    } num_fact {
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    } ArrayList<Integer> arr=new ArrayList<Integer>(); arr new ArrayList<Integer>() int cnt=0; cnt 0 for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        } int i=1; int i=1; i 1 i*i<=num i*i i i num i++ i++ i {
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        } {
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        } if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            } num%i==0 num%i num i 0 {
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            } if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                } i*i==num i*i i i num {
                    cnt+=1;
                } cnt+=1 cnt 1 {
                    cnt+=2;
                } cnt+=2 cnt 2 return cnt; cnt int num num public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    } cal {
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    } long val=1; val 1 for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        } int i=0; int i=0; i 0 i<k i k i++ i++ i {
            val*=2;
            if(val>x){
                break;
            }
        } {
            val*=2;
            if(val>x){
                break;
            }
        } val*=2 val 2 if(val>x){
                break;
            } val>x val x {
                break;
            } break; return val; val int k k int x x public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    } sort_inc {        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    } Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        }) Arrays.sort Arrays arr new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        } int[][] arr arr int col col public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    } prime {
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    } for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        } int i=2; int i=2; i 2 i*i<=n i*i i i n i++ i++ i {
            if(n%i==0){
                return false;
            }
        } {
            if(n%i==0){
                return false;
            }
        } if(n%i==0){
                return false;
            } n%i==0 n%i n i 0 {
                return false;
            } return false; false return true; true int n n static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} gcd { 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} if (b == 0) 
		return a; b == 0 b 0 return a; a return gcd(b, a % b); gcd(b, a % b) gcd b a % b a b long a a long b b class FastReader{ 
    BufferedReader br; 
    StringTokenizer st; 

    public FastReader(){ 
        br = new BufferedReader(new
                 InputStreamReader(System.in)); 
    } 
  
    String next(){ 
        while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } 
  
    int nextInt(){ 
        return Integer.parseInt(next()); 
    } 
  
    long nextLong(){ 
        return Long.parseLong(next()); 
    }
  
    double nextDouble(){ 
        return Double.parseDouble(next()); 
    }
  
    String nextLine(){ 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        }
        return str; 
    }
} FastReader BufferedReader br; br StringTokenizer st; st public FastReader(){ 
        br = new BufferedReader(new
                 InputStreamReader(System.in)); 
    } FastReader { 
        br = new BufferedReader(new
                 InputStreamReader(System.in)); 
    } br = new BufferedReader(new
                 InputStreamReader(System.in)) br new BufferedReader(new
                 InputStreamReader(System.in)) String next(){ 
        while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } next { 
        while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } st == null || !st.hasMoreElements() st == null st null !st.hasMoreElements() st.hasMoreElements() st.hasMoreElements st { 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } catch (IOException  e){ 
                e.printStackTrace(); 
            } IOException  e { 
                e.printStackTrace(); 
            } e.printStackTrace() e.printStackTrace e { 
                st = new StringTokenizer(br.readLine()); 
            } st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st int nextInt(){ 
        return Integer.parseInt(next()); 
    } nextInt { 
        return Integer.parseInt(next()); 
    } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next long nextLong(){ 
        return Long.parseLong(next()); 
    } nextLong { 
        return Long.parseLong(next()); 
    } return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next double nextDouble(){ 
        return Double.parseDouble(next()); 
    } nextDouble { 
        return Double.parseDouble(next()); 
    } return Double.parseDouble(next()); Double.parseDouble(next()) Double.parseDouble Double next() next String nextLine(){ 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        }
        return str; 
    } nextLine { 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        }
        return str; 
    } String str = ""; str "" try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        } catch (IOException e){ 
            e.printStackTrace(); 
        } IOException e { 
            e.printStackTrace(); 
        } e.printStackTrace() e.printStackTrace e { 
            str = br.readLine(); 
        } str = br.readLine() str br.readLine() br.readLine br return str; str public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    }

    static int MOD=1000000007;
    public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
} public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    }

    static int MOD=1000000007;
    public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
} Main
import java.util.*;
import java.io.*;



public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int n=sc.nextInt();
        int[] a=new int[n];
        for(int i=1;i<n;i++){
            int alpha=sc.nextInt();
            a[alpha-1]++;
        }
        for(int i=0;i<n;i++){
            out.write((a[i]+"\n").getBytes());
        }
        out.flush();
    }

    static int MOD=1000000007;
    public static int pow(int n,int k){                 //n-pow(k)
        if(k==1){
            return n%MOD;
        }
        if(k==0){
            return 1;
        }
        int val=pow(n,k/2)%MOD;
        if(k%2==0)return (val*val)%MOD;
        else return (val*val*n)%MOD;
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col])              //this is for inc
                    return 1; 
                else if(entry1[col]==entry2[col])
                    return 0;
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static long gcd(long a, long b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
}


class FastReader{ 
    BufferedReader br; 
    StringTokenizer st; 

    public FastReader(){ 
        br = new BufferedReader(new
                 InputStreamReader(System.in)); 
    } 
  
    String next(){ 
        while (st == null || !st.hasMoreElements()){ 
            try{ 
                st = new StringTokenizer(br.readLine()); 
            } 
            catch (IOException  e){ 
                e.printStackTrace(); 
            } 
        } 
        return st.nextToken(); 
    } 
  
    int nextInt(){ 
        return Integer.parseInt(next()); 
    } 
  
    long nextLong(){ 
        return Long.parseLong(next()); 
    }
  
    double nextDouble(){ 
        return Double.parseDouble(next()); 
    }
  
    String nextLine(){ 
        String str = ""; 
        try{ 
            str = br.readLine(); 
        }
        catch (IOException e){ 
            e.printStackTrace(); 
        }
        return str; 
    }
}