Number Theory Toolkit · Challenge problem

A row of $n$ small triangles (alternating up and down) is built from $2n + 1$ toothpicks. If a row uses exactly $85$ toothpicks, what is $n$?