Invariants & Monovariants · Superchallenge problem

A frog starts at $0$ on the number line and makes fifteen jumps of lengths $1, 2, \ldots, 15$ in some order, each to the left or right. What is the smallest possible distance from $0$ at which it can end?