A. Salvador
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
The wise turtles: Rafael, Leonardo, Donatello, and Michelangelo.

At the Latin American finals of the ICPC 2025 in Salvador, the organization visited the Tamar Project, where various sea turtles are rescued and cared for. Among them, four are especially respected for their wisdom and intellect: Rafael, Leonardo, Donatello, and Michelangelo.

The organization asked each of these turtles to create a plan on how they think the event's programming should be. Then, a vote was held to choose the winning plan. Each person could vote for only one turtle.

A turtle wins if it has more than half of the total votes.

So far, several people have already voted, but $$$N$$$ people have not voted yet, as they are late. The turtles then wonder: which of them still have a chance to win? After all, being wise, if a turtle has no chance of winning, it prefers to return to the sea and eat algae.

Your task is, given the current number of votes for each turtle and the number of remaining votes, to print which turtles can still win the vote.

Input

The input consists of a line with 5 integers $$$v_R \ v_L \ v_D \ v_M \ N$$$ where:

  • $$$v_R$$$: current votes for Rafael
  • $$$v_L$$$: current votes for Leonardo
  • $$$v_D$$$: current votes for Donatello
  • $$$v_M$$$: current votes for Michelangelo
  • $$$N$$$: number of people who have not voted yet

It is guaranteed that all integers are between $$$0$$$ and $$$1$$$ million.

Output

Print, in alphabetical order, the names of the turtles that can still win the election (one per line). If no turtle can still reach the majority of votes, print: "no winners".

Examples
Input
0 0 0 0 10000
Output
Donatello
Leonardo
Michelangelo
Rafael
Input
5 4 3 3 0
Output
sem vencedores
Input
10 8 6 4 12
Output
Rafael
Input
8019 5386 7532 4929 6349
Output
sem vencedores