Fibonacci numbers Euclidean algorithm

For each natural $n$, provide an example of a rectangle that would be cut into exactly $n$ squares, among which there should be no more than two identical ones.
See problem $\underline{60565}$ g).

## Answer

For example, a rectangle $F_{n} \times F_{n+1}$.