Question 117
Define an $n$-staircase to be the union of all squares of an $n \times n$ grid lying on or below its main diagonal. How many ways are there to divide a 10-staircase into 10 rectangles, each having a side of length 1? (Reflections are not included.)