Stick and polygon

Creatnx, a 7-year-old child, is playing with $7$ sticks with lengths $1, 2, \ldots, 7$, which can be connected together. He is trying to use some of them to create a polygon. Trans, his father, is looking, and since he is a programmer, he quickly comes up with a problem based on this game: There are $N$ sticks (line segments) with lengths $1, 2, 3, \ldots, N$. You should choose a non-empty subs