Determining the Strongest World Cup Team

The FIFA World Cup is a tournament with a rich history and memorable moments, featuring many nations competing for glory. In this problem, five teams are considered: China, England, France, Russia, and United States. A sports fan, after investigating these teams' historical performances, decided that the criterion for the "strongest team" is the fewest total losses in World Cup final tournaments (i.e. the sum of all losses in the tournament). Given the overall loss counts of these teams in their World Cup appearances, your task is to determine which team has the smallest number of losses. In case of a tie, choose the team that appears first in the following order: China, England, France, Russia, United States.

Note: The input will consist of 5 non-negative integers separated by spaces. The order of the integers corresponds to the teams in the order given above.

Evaluation Criterion: Find the team with the minimum number of losses and output its name.

inputFormat

The input is a single line containing 5 space-separated non-negative integers. The integers represent the total number of losses for each team in the order: China, England, France, Russia, United States.

For example: 3 1 2 4 5

outputFormat

Output a single string — the name of the team with the fewest losses. If two or more teams have the same minimum number of losses, output the team that appears first in the order: China, England, France, Russia, United States.

For example, for the input 3 1 2 4 5, the output should be England.

sample

3 1 2 4 5

England