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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;

/* Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition) 
 *  Bear and Colors
 * @author : raghumdani
*/

public class Problem_673_C {
	public static final int testCases = 1;
	
	public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        for (int t = 1; t <= testCases; ++t) {
            Problem_673_C solver = new Problem_673_C ();
            solver.solve(t, in, out);
        }
        out.close();
    }

	int[] t, x;
	
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        t = new int[n];
        x = new int[n];
        
        for(int i = 0; i < n; ++i) {
            t[i] = in.nextInt(); t[i]--;
        }
        
        for(int i = 0; i < n; ++i) {
            int[] y = new int[n];
            int mx = 0;
            for(int j = i; j < n; ++j) {
                y[t[j]]++;
                if(y[t[j]] > y[mx]) {
                    mx = t[j];
                } else if(y[t[j]] == y[mx] && t[j] < mx) {
                    mx = t[j];
                }
                
                x[mx]++;
            }
        }
        
        for(int i = 0; i < n; ++i) {
            out.print(x[i]);
            out.print((i == n - 1)?'\n': ' ');
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}