Where counting sort places a value

Counting sort is run on the array $[\,3,\ 1,\ 3,\ 2,\ 1,\ 3,\ 0\,]$ whose values lie in $\{0,1,2,3\}$. After tallying how many times each value occurs, the algorithm takes a prefix sum of those tallies to decide where each value's block begins in the sorted output, then writes elements into a $0$-indexed output array. At which $0$-indexed position does the first (leftmost) $2$ get placed?