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 <string> 
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
//#include <boost/multiprecision/cpp_int.hpp>

#define BIT(a) (1 << (a))
#define EPS (1e-10)

using namespace std;
//using namespace boost::multiprecision;

const long long MOD = 1000000007;
const int COUNTER_CLOCKWISE = 1;
const int CLOCKWISE = -1;
const int ONLINE_BACK = 2;
const int ONLINE_FRONT = -2;
const int ON_SEGMENT = 0;

class Point{
    public:
    double x, y;

    Point(double x = 0, double y = 0): x(x), y(y) {}
    
    Point operator+(Point p){return Point(x + p.x, y + p.y);}
    Point operator-(Point p){return Point(x - p.x, y - p.y);}
    Point operator*(double a){return Point(a * x, a * y);}
    Point operator/(double a){return Point(x / a, y / a);}

    bool operator < (const Point &p) const {
        return y != p.y ? y < p.y : x < p.x;
    }

    double norm(){return x * x + y * y;}
};
typedef Point Vector;
typedef vector<Vector> Polygon;

double cross(Vector a, Vector b){
    return a.x*b.y - a.y*b.x;
}

double dot(Vector a, Vector b){
    return a.x * b.x + a.y * b.y;
}

int ccw(Point p0, Point p1, Point p2){
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    if (cross(a, b) > EPS)return COUNTER_CLOCKWISE;
    if (cross(a, b) > -EPS)return CLOCKWISE;
    if (dot(a, b) < -EPS)return ONLINE_BACK;
    if (a.norm() < b.norm())return ONLINE_FRONT;

    return ON_SEGMENT;
}

Polygon andrewScan(Polygon s){
    Polygon u, l;
    if (s.size() < 3) return s;
    sort(s.begin(), s.end());
    u.push_back(s[0]);
    u.push_back(s[1]);
    l.push_back(s[s.size()-1]);
    l.push_back(s[s.size()-2]);
    
    for (size_t i = 2; i < s.size(); i++){
        for (size_t n = u.size(); n >= 2 && ccw(u[n-2], u[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            u.pop_back();
        }
        u.push_back(s[i]);
    }

    for (int i = (int)s.size() - 3; i >= 0; i--){
        for (size_t n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            l.pop_back();
        }
        l.push_back(s[i]);
    }

    reverse(l.begin(), l.end());
    for (size_t i = u.size() - 2; i >= 1; i--) l.push_back(u[i]);

    return l;
}

long long mod_pow(long long x, long long n){
    long long res = 1;
    for(int i = 0;i < 60; i++){
        if(n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}



int main(void){
    int N;
    cin >> N;
    if (!N){
        cout << 0 << endl;
        return 0;
    }
    long long total = 0;
    for (int i = 0; i < N; i++){
        long long x;
        cin >> x;
        total += x;
    }
    cout << total/N << endl;


    return 0;
}

C++: #import<iostream>
int main(){long long int i,a,n,s=0;cin>>n;for(i=n;i--;s+=a)cin>>a;cout<<s/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 <iostream>
using namespace std;
int main() {
  int n,x,a=0; cin >> n;
  for(int i=0; i<n; i++) {
    cin >> x;
    a+=x;
  }
  a/=n;
  cout << a << endl;
  return 0;
}

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

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <fstream>
#include <sstream>
#include <math.h>
#include <queue>
#include <stack>
#include <math.h>
#include <string.h>


using namespace std;


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

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

int main(){
    int n,m;
    double sum=0;

    cin>>n;

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

    cout<<(int)sum<<endl;
    return 0;
}

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

int main(void){
	int n;
	int sum = 0;

	cin>>n;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		sum += x;
	}

	cout<<sum/n<<endl;

	return 0;
}

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

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

C++: #include <cstdio>

using namespace std;

int main()
{
    double mean = 0;
    int n; double a;
    scanf( "%d\n", &n );
    double times = n;
    while( n > 0 )
    {
        scanf( "%lf\n", &a );
        mean += a;
        n--;
    }
    mean /= times;
    printf( "%.0lf\n", mean );
    return 0;
}

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