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.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.TreeMap;

public class R2 {

	public static void main(String args[]) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String s[];

		int n = Integer.parseInt(br.readLine());

		s = br.readLine().split(" ");

		int c[] = new int[n];

		for (int i = 0; i < n; i++)
			c[i] = Integer.parseInt(s[i]);

		HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
		HashMap<Integer, Integer> ans = new HashMap<Integer, Integer>();
		HashMap<Integer, Integer> an2 = new HashMap<Integer, Integer>();

		for (int i = 0; i < n; i++) {

			int curr = 0;
			hm = new HashMap<Integer, Integer>();
			ans = new HashMap<Integer, Integer>();
			int color = 0;

			for (int j = i; j < n; j++) {

				if (hm.containsKey(c[j])) {
					int val = hm.get(c[j]) + 1;
					hm.put(c[j], val);

					if (val > curr) {
						curr = val;

						color = c[j];
					} else if (val == curr) {
						if (c[j] < color) {

							color = c[j];
						}
					}

				} else {
					if (hm.isEmpty()) {

						curr = 1;
						color = c[j];
						hm.put(c[j], 1);
					} else {

						hm.put(c[j], 1);
						if (curr == 1 && c[j] < color) {

							color = c[j];

						}
					}
				}

				if (!ans.containsKey(color))
					ans.put(color, 1);
				else
					ans.put(color, ans.get(color) + 1);
			}

			for (int vb : ans.keySet()) {

				if (!an2.containsKey(vb))
					an2.put(vb, ans.get(vb));
				else
					an2.put(vb, an2.get(vb) + ans.get(vb));

			}
		}

		for (int i = 1; i <= n; i++) {
			if (an2.containsKey(i))
				System.out.print(an2.get(i) + " ");
			else
				System.out.print(0 + " ");

		}

	}
}