#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
bool prime(long long x) {
  for (long long i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
long long kai(long long x) {
  if (x == 0) return 1;
  return kai(x - 1) * x % 1000000007;
}
long long mod_pow(long long x, long long y, long long mood) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % mood;
    x = x * x % mood;
    y >>= 1;
  }
  return res;
}
long long comb(long long x, long long y) {
  return kai(x) * mod_pow(kai(x - y), 1000000007 - 2, 1000000007) % 1000000007 *
         mod_pow(kai(y), 1000000007 - 2, 1000000007) % 1000000007;
}
long long n, v[50];
long long ans;
signed main() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> v[i];
  sort(v, v + n);
  ans = (v[0] + v[1]) / 2;
  for (long long i = 2; i < n; i++) ans = (ans + v[i]) / 2;
  cout << ans << endl;
}
