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

public class CF673C{ 
  public static int index;
  public static void main(String[] args)throws Exception {
    InputReader in = new InputReader(System.in);
    PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
    int n = in.nextInt();
    int [][] a = new int[n+1][n+1], mat =  new int[n+1][n+1];
    
    int arr []= new int[n+1];
    int ans []= new int[n+1];
    
    for(int i = 1; i <= n; i++){
      arr[i] = in.nextInt();
    }
    
    for(int i = 1; i <= n; i++){
      for(int j = 1; j <= n; j++){
        if(arr[j] == i) a[i][j] = 1 + a[i][j-1];
        else a[i][j] = a[i][j-1];
      }
     // System.err.println(Arrays.toString(a[i]));
    }
    
    for(int i = 1; i <= n; i++){
    //  mat[i][i] = arr[i];
    //  System.out.println(i+" " +arr[i]+" "+mat[i][i]);
      for(int j = i; j <= n; j++){
        if(i == j){
          mat[i][j] = arr[i];
        }
        else{
          int num = arr[j];
          int x = a[mat[i][j-1]][j] - a[mat[i][j-1]][i-1];
          int y = a[num][j] - a[num][i-1];
         // if(i == 2) System.out.println(j+"   "+x+" "+y+" " + num+" " +mat[i][j-1]);
          if(x == y){
            mat[i][j] = Math.min(num, mat[i][j-1]);
          }
          else if(y > x) mat[i][j] = num;
          else mat[i][j] = mat[i][j-1];
        }
          ans[mat[i][j]]++;
        
      }
    //   System.err.println(Arrays.toString(mat[i]));
    }
      
    for(int i = 1; i <= n; i++){
      pw.print(ans[i]+" ");
    }
    pw.println();
    
    pw.close();
  }
  
  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
    
    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream));
      tokenizer = null;
    }
    
    public String next() {
  
      try {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
          tokenizer = new StringTokenizer(reader.readLine());
      } catch (IOException e) {
        return null;
      }
      
      return tokenizer.nextToken();
    }
    
    public String nextLine() {
      String line = null;
      try {
        tokenizer = null;
        line =  reader.readLine();
      } catch (IOException e) {
        throw new RuntimeException(e);
      }
      return line;
    }
    
    public int nextInt() {
      return Integer.parseInt(next());
    }
    
    public double nextDouble() {
      return Double.parseDouble(next());
    }
    
    public long nextLong() {
      return Long.parseLong(next());
    }
    public boolean hasNext(){
      try {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
          tokenizer = new StringTokenizer(reader.readLine());
      } 
      catch (Exception e) {
        return false;
      }
     
    return true; 
    
    }
  }
}