There are $n$ cards on a table in a line, with a positive real written on eachcard. LTF and Sunny are playing a game where they take turns taking away the first or the last card in line. The player that has the bigger sum of all the numberson his cards wins. If LTF goes first, find all $n$ such that LTF can always prevent Sunny from winning, regardless of the numbers written on the cards.