MathNet 1989 — Part 01 Question 15

The integers $1, 2, \ldots, n$ are placed in order so that each value is either strictly bigger than all the preceding values or is strictly smaller than all preceding values. In how many ways can this be done?