449. Ten Barrels. A merchant had 10 barrels of sugar, which he arranged into a pyramid as shown in the figure. Each barrel, except one, was marked with its own number. It turned out that the merchant had accidentally placed the barrels in such a way that the sum of the numbers along each row was 16.

![](https://cdn.mathpix.com/cropped/2024_05_21_56f37ca27ac3d928838dg-157.jpg?height=500&width=580&top_left_y=327&top_left_x=744)

Could you rearrange the barrels so that the sum of the numbers along each row equals the smallest possible number? Of course, the central barrel (which happened to be barrel number 7 in the figure) does not count in the sum.
449. Arrange 10 barrels in the following two ways, so that the sum of the numbers along each side equals 13 - the smallest possible number:

![](https://cdn.mathpix.com/cropped/2024_05_21_56f37ca27ac3d928838dg-312.jpg?height=200&width=408&top_left_y=1468&top_left_x=830)

By changing the position of the numbers (but not the numbers themselves) on each side, we can obtain 8 solutions in each case, if we do not distinguish solutions that are rotations or reflections of each other.