A fuel station logs n daily prices, one per day, in order. For each day, find the number of days you must wait until a later day whose price is strictly cheaper than the current day's price. If no later day is cheaper, report 0 for that day.
Input format
Line 1: an integer n.
Line 2: n space-separated integers, the daily prices in order.
Output format
n space-separated integers on one line: the number of days to wait for each day, in the same order.
Constraints
- 1 <= n <= 100000
- 1 <= price <= 1000000000