#include <iostream>
#include <vector>
using namespace std;

vector<int> quickSort(vector<int> vec);
int main()
{
  int n;
  cin >> n;
  vector<int> vec(n);
  for(int i=0;i<n;i++){
    cin >> vec[i];
  }
  vec = quickSort(vec);
  
  if(n%2 == 0){
    cout << double(vec[n/2-1] + vec[n/2])/2 << endl;
  }else{
    cout << vec[n/2] << endl;
  }
}
vector<int> quickSort(vector<int> vec){
  if (vec.size() <= 1){
    return vec;
  }
  int p = vec[0];
  vector<int> left;
  vector<int> right;
  for(int i=1;i<vec.size();i++){
    if(vec[i] < p){
      left.push_back(vec[i]);
    }else{
      right.push_back(vec[i]);
    }
  }
  left.push_back(p);
  
  left  = quickSort(left);
  right = quickSort(right);
  
  //v1とv2の結合...copy(v2.begin(),v2.end(),std::back_inserter(v1));
  copy(right.begin(),right.end(),back_inserter(left));
  return left;
}