#include using namespace std; typedef long long ll; typedef pair P; const int INF = 1e9; const int mod = 1e9+7; const double EPS = 1e-10; const double PI = acos(-1.0); int main() { int n; cin >> n; vector a(n); for(int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(),a.end()); cout << (n%2 ? a[n/2] : (a[n/2-1]+a[n/2])/2.0) << endl; return 0; }