BALTIC-WAY 2001 Problem 2

Let $n \geqslant 2$ be a positive integer. Find whether there exist $n$ pairwise nonintersecting nonempty subsets of $\{1,2,3, \ldots\}$ such that each positive integer can be expressed in a unique way as a sum of at most $n$ integers, all from different subsets.