Max Triangle

You have $N$ sticks of length $1, 2, ..., N$ respectively. Can you make a non-degenerate triangle$^{\dagger}$ with some $3$ sticks out of these $N$ sticks? Find the maximum possible perimeter$^{\ddagger}$ of a triangle you can make, or print $-1$ if not possible. --- $^{\dagger}$ You can make a non-degenerate triangle with sticks of sizes $A$, $B$ and $C$ if and only if $2 \cdot \max(A, B, C) <