#include
void main()
{
int i = 0, j = 0, k;
double Mark[50], max, n;
scanf ("%lf", &n);
while (n <= 100 && n >= 0)
{
Mark[i++] = n;
if (i >= 5)
break;
scanf ("%lf", &n);
}
k = i;
max = Mark[0];
for (i = 0; i < k; i++)
if (Mark[i] > max)
max = Mark[i];
printf ("其中最高分是:%lf\n", max);
}