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.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C {

    public static void main(String[] args) throws IOException {
        C solver = new C();
        solver.solve();
    }

    private void solve() throws IOException {
        FastScanner sc = new FastScanner(System.in);
//        sc = new FastScanner("4\n" +
//                "1 2 1 2\n");
//        sc = new FastScanner("3\n" +
//                "1 1 1\n");

        int n = sc.nextInt();

        int[] row = new int[n];
        for (int i = 0; i < n; i++) {
            row[i] = sc.nextInt() - 1;
        }

        int[] result = new int[n];

        int[] colors = new int[n];
        for (int i = 0; i < n; i++) {
            int maxColor = -1;
            Arrays.fill(colors, 0);

            for (int j = i; j < n; j++) {
                int newColor = row[j];

                ++colors[newColor];

                if (maxColor == -1) {
                    maxColor = newColor;
                } else if (colors[newColor] > colors[maxColor]) {
                    maxColor = newColor;
                } else if (colors[newColor] == colors[maxColor] && newColor < maxColor) {
                    maxColor = newColor;
                }

                ++result[maxColor];
            }
        }

        StringBuilder sb = new StringBuilder();
        sb.append(result[0]);
        for (int i = 1; i < n; i++) {
            sb.append(' ');
            sb.append(result[i]);
        }
        System.out.println(sb.toString());

    }

    private static class FenwickTree {
        private int[][] data;

        public FenwickTree(int capacity) {
            data = new int[capacity][capacity];
        }

        public int size() {
            return data.length;
        }

        public void update(int at, int[] by) {
            int n = data.length;
            while (at < n) {
                for (int i = 0; i < n; i++) {
                    data[at][i] += by[i];
                }
                at |= (at + 1);
            }
        }

        public int[] query(int at) {
            int n = data.length;
            int[] res = new int[n];
            while (at >= 0) {
                for (int i = 0; i < n; i++) {
                    res[i] += data[at][i];
                }
                at = (at & (at + 1)) - 1;
            }
            return res;
        }
    }

    private static class FastScanner {
        private BufferedReader br;
        private StringTokenizer st;

        public FastScanner(InputStream in) throws IOException {
            br = new BufferedReader(new InputStreamReader(in));
        }

        public FastScanner(File file) throws IOException {
            br = new BufferedReader(new FileReader(file));
        }

        public FastScanner(String s) {
            br = new BufferedReader(new StringReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                    return "";
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }

}
