Array Manipulation at Moloco (Easy)

At Moloco, managing and analyzing big data is an important part of the core business. A colleague raised a complicated question one day, and you have to help resolve it.

You are given an array $A$ of $n$ distinct integers. Build a new array $S$ of $n$ integers, where $S[i]$ is the number of elements placed before $A[i]$ that are smaller than $A[i]$.

$S[i] = |\{ j : 1 \le j < i,\ A[j] < A[i] \}|$

Indices start at 1. For instance, if $A = [10, 5, 12, 1, 11]$, then $S = [0, 0, 2, 0, 3]$.

The first line contains an integer $n$ ($1 \le n \le 1000$).

Each of the next $n$ lines contains one element of the array. Line $i+1$ holds $A[i]$. All elements are distinct and satisfy $|A[i]| \le 2 \times 10^9$.

Print $n$ lines. Line $i$ contains $S[i]$.