Given an array of n integers, you and another player take turns picking one of the outside numbers of the sequence until there are no more numbers. Prove that if n is even, the first player will always force a tie or better. Is this also true for odd n?