Question 115
$4 n$ coins of weights $1, 2, 3, \ldots, 4 n$ are given. Each coin is colored in one of $n$ colors and there are four coins of each color. Show that all these coins can be partitioned into two sets with the same total weight, such that each set contains two coins of each color.
(Hungary)
(Hungary)