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.lang.reflect.Array;
	import java.math.BigInteger;
	import java.util.*;
	 
	 
	
	
	
	import java.io.*;
	import java.lang.reflect.Array;
	import java.math.BigInteger;
	import java.util.*;
	 
	 
	public class q5 {
	
		static TreeSet<Integer> set1,set2;
		static ArrayList<Integer>[] gph;
		static int[] vis;
		static void dfs(int i, int set) {
			vis[i]=1;
			if(set==1) set1.add(i);
			else set2.add(i);
			for(int j:gph[i]) {
				if(vis[j]==0) {
					if(set==1) dfs(j,2);
					else dfs(j,1);
				}
			}
		}
		
		public static void main(String[] args) throws IOException {
			
	 		Reader.init(System.in);
	 		PrintWriter out=new PrintWriter(System.out);
			int n=Reader.nextInt();
			int[] arr=new int[n];
			for(int i=0;i<n;i++) arr[i]=Reader.nextInt();
			long[] ans=new long[n+1];
			for(int i=0;i<n;i++) {
				int[] count=new int[n+1];
				//HashMap<Integer,TreeSet<Integer>> tm=new HashMap<Integer,TreeSet<Integer>>();
				int maxcount=0;
				int cur=0;
				for(int j=i;j<n;j++) {
					int c=arr[j];
					count[c]++;
					if(count[c]>maxcount) {
						maxcount=count[c];
						cur=c;
					}
					else if(count[c]==maxcount) {
						cur=Math.min(c, cur);
					}
					ans[cur]++;
				}
			}
	 		for(int i=1;i<=n;i++) out.print(ans[i]+" ");
			out.flush();
		}
	}
	
	
	class Reader {
	    static BufferedReader reader;
	    static StringTokenizer tokenizer;
	    /** call this method to initialize reader for InputStream */
	    static void init() throws IOException {
	    	 reader = new BufferedReader(
	                 new FileReader("input.txt"));
	    tokenizer = new StringTokenizer("");
	    }
	    static void init(InputStream input) {
	        reader = new BufferedReader(
	                     new InputStreamReader(input) );
	        tokenizer = new StringTokenizer("");
	    }
	    /** get next word */
	    static String nextLine() throws IOException{
	    	return reader.readLine();
	    }
	    static String next() throws IOException {
	        while ( ! tokenizer.hasMoreTokens() ) {
	            //TODO add check for eof if necessary
	            tokenizer = new StringTokenizer(
	                   reader.readLine() );
	        }
	        return tokenizer.nextToken();
	    }
	    static int nextInt() throws IOException {
	        return Integer.parseInt( next() );
	    }
	    static long nextLong() throws IOException {
	        return Long.parseLong( next() );
	    }
	    static double nextDouble() throws IOException {
	        return Double.parseDouble( next() );
	    }
	}