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.Random;
import java.lang.Math;
public class Main {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter cout = new PrintWriter(new OutputStreamWriter(System.out));
	final static int N = 5000+50;
	final static int inf = 0x3f3f3f3f;
	static int n;
	static int[] num = new int[N];
	static int[] pos = new int[N];
	static int[] a = new int[N];
	static int[] ans = new int[N];
	public static void main(String[] args) throws IOException{
		cin.nextToken(); n = (int)cin.nval;
		for(int i = 1;i <= n;i++){
			cin.nextToken(); a[i] = (int)cin.nval;
		}
		for(int i = 1;i <= n;i++){
			Arrays.fill(num,0); Arrays.fill(pos,-1);
			int tmp = 0;
			for(int j = i;j <= n;j++){
				num[a[j]] ++;
				if(num[a[j]] > num[tmp])
					tmp = a[j];
				else if(num[a[j]] == num[tmp] && a[j] < tmp)
					tmp = a[j];
				//System.out.println("l = " + i +" r = " + j + "tmp = " + tmp);
				ans[tmp]++;
			}
		}
		for(int i = 1;i <= n;i++){
			if(i > 1)
				cout.print(" ");
			cout.print(ans[i]);
		}
		cout.println();
		cout.flush();
	}
}
