Sleepy Cow Sorting (Bronze)

Farmer John is attempting to sort his $n$ cows, conveniently numbered from $1$ to $n$, before they head out to the pastures for breakfast.

Currently, the cows are standing in a line in the order p_1, p_2, \ldots, p_n, and Farmer John is standing in front of cow p_1. He wants to reorder the cows so that they are in the order 1, 2, \ldots, n, with cow $1$ next to Farmer John.

The cows are a bit sleepy today, so at any moment, the only cow who is paying attention to Farmer John's instructions is the cow directly facing him. In one time step, he can instruct this cow to move $k$ positions down the line, for any integer $k$ in the range 1 \leq k \leq n-1. The $k$ cows whom she passes will move one step forward, making room for her to insert herself in the line after them.

For example, suppose that n = 4 and the cows start in the following order:

 FJ: 4, 3, 2, 1 

The only cow paying attention to Farmer John is cow $4$. If he instructs her to move $2$ positions down the line, the order will become:

 FJ: 3, 2, 4, 1 

Now the only cow paying attention to Farmer John is cow $3$, so in the second time step he may give cow $3$ an instruction, and so on, until the cows are sorted.

Farmer John is eager to finish sorting so he can return to the farmhouse for his own breakfast. Help him find the minimum number of time steps required to sort the cows.