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 <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	int n;
	cin>>n;
	vector<int> a(n);
	rep(i,n)
		cin>>a[i];
	cout<<accumulate(allof(a),(ll)0)/n<<endl;
	
	return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

ll GCD(ll a, ll b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

vector<string> matrix;
int main() {

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

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    long long int sum = 0;
    for (int i = 0; i < N; i++) {
        int c; cin >> c;
        sum += c;
    }

    cout << sum / N << endl;

    return 0;
}

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

using namespace std;

int main(void){
	
	int n,p = 0,temp;
	scanf("%d",&n);
	for(int i = 0; i < n ;i++){
		scanf("%d", &temp);
		p+=temp;
	}
	
	printf("%d\n",p/n);
	
	return 0;
}

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

using namespace std;

int main()
{
	int n;
	int sum=0;
	cin>>n;
	for(int i=0;i<n;++i){
		int t;cin>>t;sum+=t;
	}
	cout<<(int)floor(sum/(double)n)<<'\n';
	return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long int n,a,sum=0;
scanf("%lld",&n);
for(int i=0;i<n;i++){
scanf("%lld",&a);
sum+=a;
}
printf("%lld\n",sum/n);
return 0;
}

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

int main(){
  int n,i,j,s=0;

  cin >> n;
  for(i=0;i<n;i++){
    cin >> j;
    s+=j;
  }
  cout << s/n << endl;



}

C++: #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
	int n;
	long p,sum=0;

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

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

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

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

int main(void){
	long long int ans=0;
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int a;
		scanf("%d",&a);
		ans+=a;
	}
	printf("%d\n",ans/n);
    return 0;
}

C++: #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<25;
const double pi=acos(-1);
const double eps=1e-8;
const vi emp;

int n;

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

C++: #include<cstdio>
using namespace std;
int main(){
    int n;
    scanf("%d",&n);
    int sum=0;
    int m;
    for(int i = 0;i < n; i++){
        scanf("%d",&m);
        sum += m;
    }
    printf("%d\n",sum/n);
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <string>
#include <cmath>
#include <map>
#include <vector>
#include <sstream>

#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)

using namespace std;
typedef long long ll;



int main() {

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

C++: #include <stdio.h>
int main() {int n,i,j=0,k;scanf("%d",&n);k=n;while (n--) scanf("%d",&i),j+=i;printf("%.0lf\n",(j+0.5)/(k+0.0));return 0;}

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

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

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