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 <string>
using namespace std;

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

C++: #include <stdio.h>
int t,i,v;
long long int sum;
main() {
	for(scanf("%d",&t),i=t;scanf("%d",&v),i--;)sum+=v;
	printf("%d\n",sum/t);
}

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;
	long long ans = 0;
	for (int i = 0; i < n; i++)
	{
		long long x; cin >> x;
		ans += x;
	}
	cout << ans / n << endl;
}

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <complex>
using namespace std;
int main() {
	int n;
	cin >> n;
	int a;
	int sum = 0;
	for (int i = 0;i < n;i++) {
		cin >> a;
		sum += a;
	}
	cout << sum / n << endl;
}

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

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

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

C++: import java.util.*;

public class Main {
    public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	int N = s.nextInt();
	long sum = 0;
	for(int i = 0; i < N; ++i) {
	    sum += (long)s.nextInt();
	}
	System.out.println(sum/N);
    }
}

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

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

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

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

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

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

int main(){
	int n,tmp;
	scanf("%d",&n);

	long long sum = 0;

	for(int i = 0; i < n; i++){
		scanf("%d",&tmp);
		sum += tmp;
	}

	printf("%lld\n",sum/n);

	return 0;
}

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

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

C++: #include<iostream>

using namespace std;

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

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

		cout << ans / n << endl;
	}
}

C++: // #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef map<int, int> MAPII;
typedef vector<pair<int, int> > VPII;
typedef multimap<int, string, greater<int> > MuMIS;

#define MP make_pair
#define fastIO	cin.tie(0); ios::sync_with_stdio(false);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
//for gcc (未test)
// #define FOREACH_IT(it,c)	for(typeof(c)::iterator it=(c).begin(); it!=(c).end(); ++it)
//for Visual Studio
#define foreach_it(type,it,c) for(type::iterator it=c.begin(), c_end=c.end(); it!=c_end; ++it)

// ------------------- include, typedef, define END. -------------------

int main(){
	int n, temp = 0, now = 0;
	cin >> n;
	while (cin >> temp){
		now += temp;
	}
	int ans = now / n;
	printf("%d\n",ans);

	return 0;
}

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

C++: #include <iostream>

using namespace std;

int main(void){
    int i,j,k,l;
    int n;
    int ave;
    int data;
    int sum=0;
    
    cin>>n;
    for(i=0;i<n;i++){
        cin>>data;
        sum+=data;
    }
    ave=(int)sum/n;
    cout<<ave<<endl;
    return(0);
}

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