MathNet 2009-part-04 — 175 problems (EN–VI) Question 76

Consider $n$ children, no two of whom are of the same height. In how many ways can these children be lined up in a row so that every child except the tallest one has a neighbor who is taller than that child?