import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); sc = new Scanner(System.in); String[] inp = sc.nextLine().split(" "); int a[] = new int[n]; for (int i = 0; i < n; i++) { a[i] = Integer.parseInt(inp[i]); } Marge mm = new Marge(n); mm.sort(a, 0, n); if (n % 2 == 0) { System.out.println((a[n / 2 - 1] + a[n / 2]) / 2d); } else { System.out.println(a[n / 2]); } } } class Marge { int buf[]; Marge(int n) { buf = new int[n]; } void sort(int[] a, int s, int e) { if (1 >= e - s) return; int mid = s + (e - s) / 2; sort(a, s, mid); sort(a, mid, e); marge(a, s, mid, e); } void marge(int[] a, int s, int mid, int e) { int i = e - s; int work[] = new int[i]; int p = 0, m = mid, k = s; while (s < mid && m < e) { if (a[s] <= a[m]) { work[p++] = a[s++]; } else { work[p++] = a[m++]; } } while (s < mid) work[p++] = a[s++]; while (m < e) work[p++] = a[m++]; System.arraycopy(work, 0, a, k, i); } }