Apply Euclidean Algorithm to solve the following problem.

A company has to relocate $2023$ identical boxes. It can use two types of trucks $($no more

than $50$ of each type$)$; one can carry $21$ boxes and the other $41.$ What are the options

for moving all of the boxes if the company only sends out full trucks and all of the trucks

return empty?