Layouts of trays - Lycée Bellevue (Alès)

The problem consists in proposing an algorithm to put in order a set of n cylindrical trays, numbered from 1 to n, from the largest at the bottom to the smallest at the top. To do this, we can only proceed as follows : we can cut the set of trays at a chosen point and turn over the part which is above.