Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	sum := 0
	for i := 0; i < n; i++ {
		scanner.Scan()
		tmp, _ := strconv.Atoi(scanner.Text())
		sum += tmp
	}
	fmt.Println(sum/n)
}

C++: #include<stdio.h>

int main(){
	long long n,wa,i,t;
	
	scanf("%lld",&n);
	wa=0;
	for(i=0;i<n;i++){
		scanf("%lld",&t);
		wa+=t;
	}
	printf("%lld\n",wa/n);
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
#include<cmath>
typedef long long int ll;
#define VI vector<int>

#define rep(i,a) for(int i=0;i<(a);i++)

int n,m;

using namespace std;


int main(){
	int n;
	cin>>n;
	int sum=0;
	rep(i,n){
		int tmp;
		cin>>tmp;
		sum+=tmp;
	}
	cout<<sum/n<<endl;

	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

int main() {
	int n; cin >> n;
	ll sum = 0;
	rep(i, n) {
		ll v; cin >> v;
		sum += v;
	}
	cout << sum / n << endl;
}

C++: #include <iostream>

using namespace std;

int main() {

  int n;

  long long int sum;


  cin >> n;

  sum=0;

  for(int i=0;i<n;i++) {

    long long int val;

    cin >> val;

    sum+=val;

  }

  cout << sum/n << endl;

  return 0;

}

C++: #include<iostream>
using namespace std;

int main(void){
     int n;
     long int total=0;
     cin >> n;
     for(int i=0;i<n;i++){
	  int money;
	  cin >> money;
	  total += money;
     }
     cout << total/n << endl;
     return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
  long long n; cin >> n;
  long long x;
  long long sum = 0;
  for(int i=0; i<n; i++) {
    cin >> x;
    sum += x;
  }
  cout << sum / n << endl;
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int main(){
	
	int n, sum, a;
	
	cin >> n;
	
	sum = 0;
	
	for(int i = 0; i < n; i++){
		cin >> a;
		sum += a;
	}
	
	printf("%d\n", sum / n);
	
	return 0;
}

C++: #include<iostream>
#include<vector>

using namespace std;

#define rep(i,a) for(int i = 0 ; i < a ; i ++)

int main(void){
	long long int n,sum=0;
	cin>>n;
	rep(i,n){
		int num;
		cin>>num;
		sum+=num;
	}	
	cout<<sum/n<<endl;
}

C++: #include <iostream>

using namespace std;

int main() {

  int n;

  long int sum;


  cin >> n;

  sum=0;

  for(int i=0;i<n;i++) {

    long int val;

    cin >> val;

    sum+=val;

  }

  cout << sum/n;

  return 0;

}

C++: #include<stdio.h>

int main(void){
	int n,g,i,sum=0;

	scanf("%d",&n);
	for(i=0;i<n;i++)
		sum+=scanf("%d",&g);
	printf("%d\n",sum/n);
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main() {
	long long int a, b;
	int n,m;
	cin >> n;
	a = 0;
	for (int i = 1; i <= n; i++) {
		cin >> m;
		a = a + m;
	}
	cout << a / n << endl;
}

C++: // Tazoe

#include <iostream>
using namespace std;

int main()
{
	int n;
	cin >> n;

	long long sum = 0;
	for(int i=0; i<n; i++){
		int m;
		cin >> m;

		sum += (long long)m;
	}

	cout << sum/(long long)n << endl;

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
	long n;
	cin >> n;
	long long sum = 0;
	for (int i = 0; i < n; i++){
		int a;
		cin >> a;
		sum += a;
	}
	cout << sum / n << endl;
	return 0;
}

C++: #include <stdio.h>
#include <iostream>

using namespace std;

int main() {
	int a;
	int counter;
	double sum = 0;
	int kekka;

	cin >> counter;

	for (int i = 0; i < counter; i++) {
		cin >> a;
		sum += ((double)a / (double)counter);
	}

	kekka = (int)sum;

	cout << kekka << endl;
	return 0;
}

C++: #include<stdio.h>

int main(void){
	unsigned long long int n,g,i,sum=0;

	scanf("%d",&n);
	for(i=0;i<n;i++)
		sum+=scanf("%d",&g);
	printf("%d\n",sum/n);
}

C++: #include <iostream>

using namespace std;

int main(){
  int num,sum=0,add;
  cin >> num;
  for(int i=0;i<num;i++){
    cin >> add;
    sum +=add;
  }
  cout << sum/num << endl ;
}

C++: #include<iostream>
using namespace std;

main(){
    int n; cin >> n;
    long long x, sum = 0;
    for ( int i = 0; i < n; i++ ){
	cin >> x; sum += x;
    }
    
    cout << (int)(sum/n) << endl;
}

C++: #include <iostream>
using namespace std;

int main(){
	long long int n,i,a,t = 0;
	cin >> n;
	for(i = 0;i < n;++i){
		cin >> a;
		t += a;
	}
	cout << t / n << endl;
	return 0;
}

C++: #include<stdio.h>
 
int main(){
	int a, i, b;
	unsigned long long int ans = 0;
	scanf("%d", &a);
	for(i = 0; i < a; i++){
		scanf("%d", &b);
		ans += b;
	}
	printf("%lld\n", ans / a);
	return 0;
}

C++: #include<iostream>
using namespace std;long long n,a,v;main(){for(cin>>n;cin>>a;)v+=a;cout<<v/n<<endl;return;}

C++: #include<iostream>
#include<vector>
#include<string>
using namespace std;

int main(){
int a;cin>>a;
long  s=0;
for(int b=0;b<a;b++){
	int c;
	cin>>c;
	s+=c;
	}
	cout<<s/a;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	while(cin>>n&&n!=0){
		long long sum=0;
		for(int i=0;i<n;i++){
			int a;
			cin>>a;
			sum+=a;
		}
		sum/=n;
		cout<<sum<<endl;
	}
}

C++: /*
	0134:Exit Survery
*/
#include	<iostream>

using namespace std;

int main(void) {
	int w, ave, sum = 0;
	
	cin >> w;
	for(int i = 0; i < w; i++) {
		int bu;
		
		cin >> bu;
		sum += bu;
	}
	ave = sum / w;
	cout << ave << endl;
	
	return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;






int main() {
	ll n, s = 0, a;
	cin >> n;
	rep(i, n) {
		cin >> a;
		s += a;
	}
	s /= a;
	cout << s << endl;
}

C++: #include<stdio.h>

int main(void){
	int n,g,i,sum=0;
	double ave;

	scanf("%d",&n);
	for(i=0;i<n;i++)
		sum+=scanf("%d",&g);
	ave=sum/n;
	printf("%d\n",(int)sum/n);
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF= 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;

#define rep(i, n) for(int i = 0; i < n; i++)

double cross(const xy_t &a, const xy_t &b){
	return imag(conj(a) * b);
}

double dot(const xy_t &a, const xy_t &b){
	return real(conj(a) * b);
}

xy_t projection(const line &l, const xy_t &p){
	double t = dot(p - l.first, l.first - l.second) / norm(l.first - l.second);
	return l.first + t * (l.first - l.second);
}

bool intersectSP(const line &l, const xy_t &p){
	return abs(l.first- p) + abs(l.second - p) - abs(l.first - l.second) < EPS;
}

double distanceSP(line s, xy_t p){
	const xy_t r = projection(s, p);
	if(intersectSP(s, r)) return abs(r - p);
	return min(abs(s.first - p), abs(s.second - p));
}

int main(){
	int n;
	cin >> n;
	ll sum = 0;
	ll num;
	rep(i, n){
		cin >> num;
		sum += num;
	}
	cout << sum / n << endl;
	return 0;
}