Let $n$ be a natural number. What is the least number $m$ ($m>n$) such that the set of all natural numbers forn $n$ to $m$ (inclusively) can be divided into subsets such that in each subset one of the numbers equals the sum of other numbers in this subset?