Question 108
Given a rearrangement of the numbers from $1$ to $n$, each pair of consecutive elements $a$ and $b$ of the sequence can be either increasing (if $a \lt b$) or decreasing (if $b \lt a$). How many rearrangements of the numbers from $1$ to $n$ have exactly two increasing pairs of consecutive elements?