Codeforces div.2 B. The Child and Set

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks. Fortunately, Picks remembers something about his set S :

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks.

Fortunately, Picks remembers something about his set S:

• its elements were distinct integers from 1 to limit;
• the value of was equal to sum; here lowbit(x) equals 2^k where k is the position of the first one in the binary representation of x. For example, lowbit(10010₂)?=?10₂,?lowbit(10001₂)?=?1₂,?lowbit(10000₂)?=?10000₂ (binary representation).

Can you help Picks and find any set S, that satisfies all the above conditions?