There are n walruses standing in a queue in an airport. They are numbered starting from the queue's tail: the 1-st walrus stands at the end of the queue and the n-th walrus stands at the beginning of the queue. The i-th walrus has the age equal to ai.

The i-th walrus becomes displeased if there's a younger walrus standing in front of him, that is, if exists such j (i < j), that ai > aj. The displeasure of the i-th walrus is equal to the number of walruses between him and the furthest walrus ahead of him, which is younger than the i-th one. That is, the further that young walrus stands from him, the stronger the displeasure is.

The airport manager asked you to count for each of n walruses in the queue his displeasure.

Input

The first line contains an integer n (2 ≤ n ≤ 105) — the number of walruses in the queue. The second line contains integers ai (1 ≤ ai ≤ 109).

Note that some walruses can have the same age but for the displeasure to emerge the walrus that is closer to the head of the queue needs to be strictly younger than the other one.

Output

Print n numbers: if the i-th walrus is pleased with everything, print "-1" (without the quotes). Otherwise, print the i-th walrus's displeasure: the number of other walruses that stand between him and the furthest from him younger walrus.

Examples

Input

6
10 8 5 3 50 45


Output

2 1 0 -1 0 -1 

Input

7
10 4 6 3 2 8 15


Output

4 2 1 0 -1 -1 -1 

Input

5
10 3 1 10 11


Output

1 0 -1 -1 -1 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class A {
		
	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = sc.nextInt(), a[] = new int[n];
		TreeSet<Integer> set = new TreeSet<>();
		for(int i = 0; i < n; ++i)
			set.add(a[i] = sc.nextInt());
		TreeMap<Integer, Integer> map = new TreeMap<>();
		int idx = 0;
		for(int x: set)
			map.put(x, ++idx);
		for(int i = 0; i < n; ++i)
			a[i] = map.get(a[i]);
		SegmentTree st = new SegmentTree(idx);
		for(int i = n - 1; i >= 0; --i)
		{
			int q = st.query(0, a[i] - 1);
			st.update(a[i], i + 1);
			a[i] = q == 0 ? -1 : q - (i + 2);
		}
		for(int x: a)
			out.print(x + " ");
		out.flush();
		out.close();
	}
	
	static class SegmentTree
	{
		int[] sTree;
		int N;
		
		SegmentTree(int n)
		{
			N = 1; while(N < n) N <<= 1;
			sTree = new int[N<<1];
		}
		
		void update(int idx, int val)
		{
			idx += N - 1;
			if(sTree[idx] != 0)
				return;
			sTree[idx] = val;
			while(idx > 1)
			{
				idx >>= 1;
				sTree[idx] = Math.max(sTree[idx<<1], sTree[idx<<1|1]);
			}
		}
		
		int query(int l, int r) { return query(1, 1, N, l, r); }
		
		int query(int node, int b, int e, int l, int r)
		{
			if(r < b || e < l)
				return 0;
			if(l <= b && e <= r)
				return sTree[node];
			int mid = b + e >> 1;
			return Math.max(query(node<<1, b, mid, l, r), query(node<<1|1, mid + 1, e, l, r));
		}
	}

	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

		public long nextLong() throws IOException {return Long.parseLong(next());}

	}
} 