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 <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  double sum = 0;
  cin >> n ;

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

C++: #include <iostream>

using namespace std;

int main(int argc, char **argv)
{
	int n, m = 0, tmp;
	
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> tmp;
		m += tmp;
	}
	cout << (int)(m/n) << endl;
	
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,w=100000;
    cin>>n;
    double num,ans;
    cin>>ans;
    ans/=w;
    for(int i=1;i<n;i++){
        cin>>num;
        num/=w;
        ans+=num;
    }
    ans/=n;
    n=ans*w;
    cout<<n<<endl;
}

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

#define rep(i,n) for(long long i=0;i<n;i++)
using namespace std;
typedef long long ll;

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

	ll ans = 0;
	rep(i,n)
	{
		ll temp;
		cin >> temp;

		ans += temp;
	}
	ans /= n;
	cout << ans << endl;
	return 0;
}

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

int main()
{
  long res = 0;
  int n;

  cin >> n;
  for (int i = 0; i < n; i++){
    long num;
    cin >> num;
    res += num;
  }

  cout << res / n << endl;
}

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

C++: # define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <map>
# include <stack>
using namespace std;
//# define M_PI 3.141592
# define INF ((int)(1<<30))
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define CHECK(i,a) FOR(i,a.size())cout<<#a<<"["<<i<<"] : "<<a[i]<<endl; 

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 k) { return Point(x * k, y * k); }
	Point operator / (double k) { return Point(x / k, y / k); }
	bool operator < (const Point &p)const { return x != p.x ? x < p.x : y < p.y; }
	bool operator ==(const Point &p)const { return fabs(x - p.x) < EPS&&fabs(y - p.y) < EPS; }

	double abs() { return sqrt(norm()); }
	double norm() { return x*x + y*y; }
};
typedef Point Vector;
struct Segment
{
	Point p1, p2;
};
typedef Segment Line;
class Circle
{
public:
	Point c;
	double r;
	Circle(Point c = Point(), double r = 0.0) :c(c), r(r) {}
};

double dot(Vector a, Vector b) { return a.x*b.x + a.y*b.y; }//??????
double cross(Vector a, Vector b) { return a.x*b.y - a.y*b.x; }//??????
bool isOrthogonal(Vector a, Vector b) { return fabs(dot(a, b)) < EPS; }//??´??????
bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) { return isOrthogonal(a1 - a2, b1 - b2); }
bool isOrthogonal(Line l1, Line l2) { return fabs(dot(l1.p2 - l1.p1, l2.p2 - l2.p1)) < EPS; }
bool isParallel(Vector a, Vector b) { return fabs(cross(a, b)) < EPS; }//?????????
bool isParallel(Point a1, Point a2, Point b1, Point b2) { return isParallel(a1 - a2, b1 - b2); }
bool isParallel(Line l1, Line l2) { return fabs(cross(l1.p2 - l1.p1, l2.p2 - l2.p1)) < EPS; }
Point project(Line s, Point p)
{
	Vector base = s.p2 - s.p1;
	double r = dot(p - s.p1, base) / base.norm();
	return s.p1 + base*r;
}


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

C++: #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	lint n,sum=0;
	cin>>n;
	rep(i,0,n){
		lint a;
		cin>>a;
		sum+=a;
	}
	o(sum/n);
}

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

#define pb push_back
#define fr first
#define sc second
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> pip; 
const int INF = (1<<25);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main() {

  int sum=0;
  int n;

  cin>> n;
  for(int i=0; i<n; i++){
    int money;
    cin>> money;
    sum+=money;
  }
  if(sum) cout<< sum/n<< endl;
  else cout<< sum<< endl;
}

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

C++: #include<iostream>

typedef long long ll;

int main()
{
	ll n;
	std::cin >> n;
	
	ll sum = 0;
	for( int i = 0; i != n; ++i )
	{
		ll p;
		std::cin >> p;
		sum += p;
	}

	std::cout << sum / n << std::endl;

	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n, ans = 0, wk;
	cin >> n;

	for(int i = 0; i < n; i++)
	{
		cin	>> wk;
		ans += wk;
	}
	
	cout << ans / n<< endl;
}

C++: #include <cstdio>
int main()
{
    int n, t;
    long long res = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &t);
        res += t;
    }
    printf("%d\n", (int)(res / n));
    return 0;
}

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

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