#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 10;
int power(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= MOD) ret %= MOD;
    if (a >= MOD) a %= MOD;
    b >>= 1;
  }
  return ret;
}
int invmod(int x) { return power(x, MOD - 2); }
int main() {
  int n;
  cin >> n;
  int a[6];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  if (n == 1) {
    cout << a[1] << endl;
    return 0;
  }
  cout << a[(n / 2) + 1] << endl;
}
