Bessie likes downloading games to play on her cell phone, even though she does find the small touch screen rather cumbersome to use with her large hooves.

She is particularly intrigued by the current game she is playing. The game starts with a sequence of N positive integers (2 \leq N \leq 262,144), each in the range 1 \ldots 40. In one move, Bessie can take two adjacent numbers with equal values and replace them a single number of value one greater (e.g., she might replace two adjacent 7s with an 8). The goal is to maximize the value of the largest number present in the sequence at the end of the game. Please help Bessie score as highly as possible!

Problem credits: Mark Chen

#3974 upload 2 done 2 how_to_reg 2

262144 timer 2s memory 512MB

#3974

262144 2s 512MB