Jasmine, the princess of Agrabah is enjoying the festival with her father. Since child- hood, Jasmine has been very fond of shooting games and she has become really good at it. After hitting at various shops she finally found a shooting place. The shopkeeper is smart and has changed the rules of the game. The shopkeeper has placed a sequence of n water balloons each with an integer written on it. The rules of the game are that the shooter can choose any balloon of the sequence (let's denote on it as ak) and remove it by shooting. During this step, all elements equal to `a_(k)-1` and `a_(k)+1` should also be shot down and removed from the sequence. This step will give the player `a_(k)` score. At each step, only one occurrence of `a_(k)` is deleted. The player should apply this step, again and again, to get as much score as possible.
Example Seq: 1 2 3
In the first step choose element 3, delete it and delete `3-1=2` and `3+1=4`(4 not avail- able). The remaining array contains element only 1. now pick this and the array becomes empty now. therefore, maximum score obtained is `3+1=4`
Given seq: 1 2 2 2 3 4 5 1 2 2 5 4 6 3 2 9 9 8 8 2 3 3 5 1 5 2 4 3 2 1 2 6
Find the maximum score that Jasmine can get?