Puzzle ID: 1000robbers 

One thousand robbers meet in their hideout and plan to divide all the loot
they stole. All robbers value their life above everything. They are smart, greedy
(want as much loot as possible) and bloodthirsty (given two different outcomes
with the same payoff for a robber, he prefers the one where more other robbers
die). They all know this information. 

The robbers agreed that every day they will take a vote. If at least 50% of
the robbers vote to split the loot, everybody takes a fair share and leaves
the hideout. Otherwise the currently youngest robber is shot.

How many robbers will survive? In the last round of voting, how many of them
will vote for splitting the loot? (Assume that if a robber knows that his vote
doesn't matter, he votes against splitting the loot.)

The answer for this puzzle consists of three lines, containing respectively:
- the ID of this puzzle
- the number of robbers that survive
- the number of robbers that voted to split the loot in the last round 
