There is a fence that consists of $n$ planks arranged in a line. Each plank is painted with one of the available $100$ colors. Suppose that for any two distinct colors $i$ and $j$, there is a plank with color $i$ located to the left of a (not necessarily adjacent) plank with color $j$. Determine the minimum possible value of $n$.