#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cctype>
#include <unordered_map>
#include <map>
using namespace std
;
const int N
= 105;
typedef pair
<int, string
> PII
;
int main(){
int n
, x
;
while(cin
>>n
){
double res
= 0, sum
= 0;
for(int i
= 0; i
< n
; i
++){
cin
>>x
;
sum
+= x
;
}
printf("%.2f\n", sum
*1.0/n
);
}
return 0;
}
转载请注明原文地址: https://mac.8miu.com/read-39487.html