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.
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  while (b) {
    int m = a % b;
    a = b;
    b = m;
  }
  return a;
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
int isPrim(int a) {
  if (a == 1) {
    return 0;
  }
  for (int i = 2; i <= (a + 1) / 2; i++) {
    if (a % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long mod_pow(long long x, long long n, long long mod) {
  long long ret = 1;
  while (n > 0) {
    if (n % 2 == 1) {
      ret = (ret * x) % mod;
    }
    x = (x * x) % mod;
    n = n / 2;
  }
  return ret;
}
struct VV {
  int x;
  int y;
  int z;
};
class LessInt {
 public:
  bool operator()(const VV& riLeft, const VV& riRight) const {
    if (riLeft.x == riRight.x) {
      return riLeft.y > riRight.y;
    }
    return riLeft.x > riRight.x;
  }
};
class indInt {
 public:
  bool operator()(const VV& riLeft, const VV& riRight) const {
    return riLeft.x < riRight.x;
  }
};
struct XX {
  int u;
  int v;
};
class xxInt {
 public:
  bool operator()(const XX& riLeft, const XX& riRight) const {
    if (riLeft.u != riRight.u) {
      return riLeft.u < riRight.u;
    }
    return riLeft.v < riRight.v;
  }
};
int main(int argc, const char* argv[]) {
  int n;
  cin >> n;
  int ball[5000];
  for (int i = 0; i < n; i++) {
    cin >> ball[i];
  }
  int ans[5000];
  for (int p = 0; p < 5000; p++) {
    ans[p] = 0;
  }
  for (int i = 0; i < n; i++) {
    int tmp[5000];
    for (int p = 0; p < 5000; p++) {
      tmp[p] = 0;
    }
    int maxi = n + 1;
    int maxti = 0;
    for (int j = i; j < n; j++) {
      tmp[ball[j] - 1]++;
      if (tmp[ball[j] - 1] > maxti ||
          (tmp[ball[j] - 1] == maxti && ball[j] - 1 < maxi)) {
        ans[ball[j] - 1]++;
        maxi = ball[j] - 1;
        maxti = tmp[ball[j] - 1];
      } else {
        ans[maxi]++;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i];
    if (i != n - 1) {
      cout << " ";
    }
  }
  cout << endl;
  return 0;
}
