Bear Limak has n colored balls, arranged in one long row. Balls are numbered 1 through n, from left to right. There are n possible colors, also numbered 1 through n. The i-th ball has color ti.

For a fixed interval (set of consecutive elements) of balls we can define a dominant color. It's a color occurring the biggest number of times in the interval. In case of a tie between some colors, the one with the smallest number (index) is chosen as dominant.

There are <image> non-empty intervals in total. For each color, your task is to count the number of intervals in which this color is dominant.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 5000) — the number of balls.

The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ n) where ti is the color of the i-th ball.

Output

Print n integers. The i-th of them should be equal to the number of intervals where i is a dominant color.

Examples

Input

4
1 2 1 2


Output

7 3 0 0 


Input

3
1 1 1


Output

6 0 0 

Note

In the first sample, color 2 is dominant in three intervals:

  * An interval [2, 2] contains one ball. This ball's color is 2 so it's clearly a dominant color. 
  * An interval [4, 4] contains one ball, with color 2 again. 
  * An interval [2, 4] contains two balls of color 2 and one ball of color 1. 



There are 7 more intervals and color 1 is dominant in all of them.
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    private static StreamTokenizer in;
    private static Scanner ins;
    private static PrintWriter out;
    private int[] nearLeft;
    private int[] nearRight;
    private int left;
    private int right;

    public static void main(String[] args) {

        try {
            in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
            ins = new Scanner(System.in);
            out = new PrintWriter(System.out);
            try {
                if (System.getProperty("xDx") != null) {
                    in = new StreamTokenizer(new BufferedReader(new FileReader("input.txt")));
                    ins = new Scanner(new FileReader("input.txt"));
                    out = new PrintWriter(new FileWriter("output.txt"));
                }
            } catch (Exception e) {
                in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
                ins = new Scanner(System.in);
                out = new PrintWriter(System.out);
            }
            new Main().run();
            out.close();
        } catch (Throwable e) {
//            e.printStackTrace();
            throw new RuntimeException(e);
        }
    }

    private int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    private long nextLong() throws IOException {
        in.nextToken();
        return (long) in.nval;
    }

    private double nextDouble() throws IOException {
        in.nextToken();
        return in.nval;
    }


    private String nextString() throws IOException {
        in.nextToken();
        return in.sval;
    }

    private char nextChar() throws IOException {
        in.nextToken();
        return (char) in.ttype;
    }


    private void run() throws Exception {
        int n = nextInt();
        int[] a = new int[n];
        List<Color> colors = new ArrayList<>(n);
        int[] answ = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = nextInt();
            colors.add(new Color(i));
        }

        for (int i = 0; i < n; i++) {
            int maxId = i;
            for (int j = i; j < n; j++) {
                int id = a[j] - 1;
                Color c = colors.get(id);
                c.inc();
                if(c.compareTo(colors.get(maxId)) < 0) {
                    maxId = id;
                }
                answ[maxId]++;
            }
            colors.forEach(Color::reset);
        }

        Arrays.stream(answ).forEach(e -> out.print(e + " "));
    }

    private class Color implements Comparable<Color> {
        int id;
        int count;

        public Color(int id) {
            this.id = id;
        }

        void inc() {
            count++;
        }

        void dec() {
            count--;
        }

        void reset(){
            count = 0;
        }

        @Override
        public int compareTo(Color o) {
            if(id == o.id) {
                return 0;
            }
            if (count == o.count) {
                return Integer.compare(id, o.id);
            }
            return Integer.compare(o.count, count);
        }

        @Override
        public boolean equals(Object o) {
            return id == ((Color)o).id;
        }
    }

    private int gcd(int a, int b) {
        while (a > 0 && b > 0) {
            int k = a % b;
            a = b;
            b = k;
        }

        return a | b;
    }


}