RU-SPB 2012 Problem 97

We have $2012$ sticks with integer length, and sum of length is $n$ . We need to have sticks with lengths $1,2,....,2012$ . For it we can break some sticks ( for example from stick with length $6$ we can get $1$ and $4$ ). For what minimal $n$ it is always possible?