Question 77
A straight stick of length $2$ m is cut into $N$ pieces, the length of each (measured in centimeters) is an integer number. Find the least value of $N$ such that it is always possible to make a rectangular contour using all the obtained pieces. (It is not allowed to break the pieces.)