Question 2A recruit starts at $0$ on a number line and makes jumps, each either forwards or backwards, of lengths $2,4,8,16,32,64,128$ in that order. How many distinct final locations are possible?