King Boo has $$$N$$$ ghosts standing in a line. This year, they decide that they want to go ghosting and treating. While trick-or-treating is relatively simple for humans, for ghosts, instead they need to scare people and steal their candy when they're terrified. But, being ghosts, they're kind of lazy, and so Boo has decided a system where only one ghost will go out and do this task this year so everyone can have some candy.

Every single ghost has been a ghost for a certain number of whole number years. Boo has decided to repeatedly pick out two ghosts with different "ages" that are adjacent to each other in the line, and if one of them has been a ghost longer than the other, the younger ghost will step out of line and is no long in the running to be a ghost-or-treater. However, matches are tiring to the participants involved, so the ghost that stays in line will effectively age a year. This process repeats until all Boo can no longer select two ghosts, and Boo will declare the remaining ghost(s) the "winner(s)" to go ghost-or-treating.

Given the ages of each of the ghosts in order, is there a way that Boo can set up the matches such that only one ghost will have to go ghost-or-treating (in other words, only one ghost will be remaining in line)?