#include <stdio.h>
#define TYPENUM 5
int main(void)
{
unsigned int figure, N;
if (scanf("%u", &N) != 1)
return 0;
unsigned int A[TYPENUM][N], a[TYPENUM];
for (unsigned int i = 0; i != TYPENUM; i++)
a[i] = 0;
// classify
while (scanf("%u", &figure) == 1)
{
switch(figure%5)
{
case 0:
A[0][a[0]++] = figure;
break;
case 1:
A[1][a[1]++] = figure;
break;
case 2:
A[2][a[2]++] = figure;
break;
case 3:
A[3][a[3]++] = figure;
break;
case 4:
A[4][a[4]++] = figure;
break;
}
}
// implement function
for (int i = 0; i != TYPENUM; i++)
{
if (a[i] == 0)
printf("%c", 'N');
else
{
float ret = 0;
switch(i)
{
case 0:
for (int j = 0; j != a[0]; j++)
{
if (A[0][j]%2 == 0)
ret += A[0][j];
}
ret ? printf("%u", (unsigned int) ret) : printf("%c", 'N');
break;
case 1:
for (int j = 0; j != a[1]; j++)
{
if (j%2)
ret -= A[1][j];
else
ret += A[1][j];
}
printf("%d", (int) ret);
break;
case 2:
printf("%u", a[2]);
break;
case 3:
for (unsigned int j = 0; j != a[3]; j++)
ret += A[3][j];
ret /= (float) a[3];
printf("%.1f", ret);
break;
case 4:
for (unsigned int j = 0; j != a[4]; j++)
ret = ret > A[4][j] ? ret : A[4][j];
printf ("%u", (unsigned int) ret);
break;
}
}
if (i != TYPENUM-1)
printf(" ");
}
return 0;
}