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.Arrays;
import java.io.StringWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.util.Collection;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskA extends SimpleSolution {

  public void solve(int testNumber) {
    int n = in.nextInt();

    int[] res = new int[n + 1];

    int[] a = in.nextIntArray(n);

    int[] count = new int[n + 1];

    for (int i = 0; i < n; i++) {
      Arrays.fill(count, 0);
      int max = -1;
      int maxi = -1;
      for (int j = i; j < n; j++) {
        count[a[j]]++;
        if (count[a[j]] > max || (count[a[j]] == max && a[j] < maxi)) {
          max = count[a[j]];
          maxi = a[j];
        }
        res[maxi]++;
      }
    }

    for (int i = 1; i <= n; i++) {
      out.print(res[i] + " ");
    }
    out.println();
  }
}

abstract class SimpleSolution extends AbstractSolution {

  public SimpleSolution() {
    super();
    saveToFile = false;
  }

  public String postProcessTestOutput(String output, int testNumber) {
    return output;
  }
}

class InputReader {

	BufferedReader br;
	StringTokenizer in;

  public InputReader(InputStream inputStream) {
		br = new BufferedReader(new InputStreamReader(inputStream));
	}

	boolean hasMoreTokens() {
		while (in == null || !in.hasMoreTokens()) {
			String s = nextLine();
			if (s == null) {
				return false;
			}
			in = new StringTokenizer(s);
		}
		return true;
	}

	public String nextString() {
		return hasMoreTokens() ? in.nextToken() : null;
	}

	public String nextLine() {
		try {
			in = null;
			return br.readLine();
		} catch (Exception e) {
			e.printStackTrace();
			return null;
		}
	}

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

  public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = nextInt();
		}
		return a;
	}

}

abstract class AbstractSolution {

  protected InputReader in;
  protected OutputWriter out;

  protected OutputWriter log;

  protected boolean saveToFile = true;

  private OutputWriter fileOut;

  public AbstractSolution() {
    log = new OutputWriter(System.out);
  }

  private boolean initialized = false;

  public void init() {
    if (saveToFile) {
      try {
        fileOut = new OutputWriter("chelper-output/last_output.txt");
      } catch (FileNotFoundException e) {
        e.printStackTrace();
      }
    }
  }

  public void solve(int testNumber, InputReader in, OutputWriter out) {
    if (!initialized) {
      init();
      initialized = true;
    }

    StringWriter sw = new StringWriter();

    this.in = in;
    this.out = new OutputWriter(sw);

    solve(testNumber);

    String testOutput = postProcessTestOutput(sw.toString(), testNumber);

    out.print(testOutput);
    out.flush();

    if (saveToFile) {
      fileOut.print(testOutput);
      fileOut.flush();
    }

    log.flush();
  }

  abstract public void solve(int testNumber);

  abstract public String postProcessTestOutput(String output, int testNumber);
}

class OutputWriter extends PrintWriter {

  public OutputWriter(String fileName) throws FileNotFoundException {
        super(fileName);
    }

    public OutputWriter(OutputStream outputStream) {
        super(outputStream);
    }

    public OutputWriter(Writer writer) {
        super(writer);
    }

}

