Question 48
There are $k$ heaps of beads on the table containing 2019 beads in total. In each move we choose a heap: either remove it from the table or divide it into two not necessarily equal parts. Find the maximal possible value of $k$ such that for any initial distribution of beads after finite number of moves one can get $k$ heaps with pairwise distinct number of beads.