Winner Prediction

John and Manoj are travelling in a train and they are bored of journey. So they decide to play a game, the rules for which are described below. Given array A containing n integers, they take turns making a single move. John moves first always, and both players are moving optimally (playing to win with no mistakes). During each move, the current player chooses one element from A, adds it to their