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>
long long n,a,v;main(){for(std::cin>>n;std::cin>>a;)v+=a;printf("%d\n",v/n);}

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;
	ll sum=0;
	rep(i,n){
		int tmp;
		cin>>tmp;
		sum+=tmp;
	}
	if(n==0)cout<<"0"<<endl;
	else cout<<(int)(sum/n)<<endl;

	return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

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

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<<endl;
}

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

int main(){

	int n, m;
	long long sum;

	sum = 0;
	
	cin >> n;
	
	for(int i=0; i<n; i++){
		cin >> m;
		sum += m;
	}
	
	cout << floor((double)sum / n) << endl;

	return 0;

}

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

C++: #include <iostream>
typedef unsigned long long ull;
int main()
{
	int n; std::cin >> n;
	ull sum = 0;
	for (int i=0; i<n; i++) {
		ull v; std::cin >> v;
		sum += v;
	}
	std::cout << sum / (ull)n << std::endl;
	
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

signed main() {
	int n; cin >> n;
	vector<int>v(n); rep(i, 0, n)cin >> v[i];
	cout << accumulate(v.begin(), v.end(), 0) / n << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

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

C++: #include <iostream>

using namespace std;

long long n,a,total;

int main(void){

  total = 0;
  cin >> n;

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

C++: #include <iostream>

using namespace std;

int main()
{
	int n, m, k, x;

	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> k;
		m += k / n;
		x += k % n;
	}
	cout << m + x << endl;
}

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

C++: #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        int x;
        scanf("%d", &x);
        ans += x;
    }
    cout << ans/n << "\n";
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>

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

}

C++: #include<iostream>
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++: #include<stdio.h>
int main()
{
	int n,i,s=0,t;
	scanf("%d",&n);
	for(i=0;i<n;++i)
		scanf("%d",&t),s+=t;
	printf("%d\n",s/n);
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
  int n;
  int rn[100000];
  int ave=0;

  while(cin >> n) {
    for(int i = 0 ; i < n ; i++) {
      cin >> rn[i];
      ave += rn[i];
    }
    
    ave /= n;
    cout << ave << endl;
    ave = 0;
  }   
  return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n,i;
	double a,b=0;
	int ans;
	
	cin >> n ;
	for(i=0;i<n;i++)
	{
		cin >> a ;
		b+=a/n;
	}
	ans=b;
	cout << ans << endl;
}

C++: #import<iostream>
int main(){long long int i,a,n,s=0;std::cin>>n;for(i=n;i--;s+=a)cin>>a;std::cout<<s/n<<"\n";}

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

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

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

  return 0;


}

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

int main() {

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

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

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

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

typedef long long ll;

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

	return 0;
}

C++: #include <stdio.h>

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

C++: #include <cstdio>
int main()
{
        long long cus;
        long long  spe[1000000];
        long long cnt;
        scanf("%lld",&cus);

        int sum=0;

        for(cnt=0;cnt<cus;cnt++)
        {
                scanf("%lld",&spe[cnt]);
                sum=sum+spe[cnt];
        }
        long long ans;
        ans=sum/cus;
        printf("%lld\n",ans);

        return 0;
}