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<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int n,v;
  cin>>n;
  ll sum=0;
  rep(i,n){
    cin>>v;
    sum+=v;
  }
  cout<<sum/n<<endl;
}

C++: #include <iostream>

using namespace std;

int main(){
  long num,sum=0,add;
  cin >> num;
  for(long i=0;i<num;i++){
    cin >> add;
    sum +=add;
  }
  cout << sum/num << endl ;
}

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

using namespace std;

int main(){
	
	long long int n, sum, a;
	
	cin >> n;
	
	sum = 0;
	
	for(int i = 0; i < n; i++){
		cin >> a;
		sum += a;
	}
	
	printf("%lld\n", sum / n);
	
	return 0;
}

C++: #import<iostream>
int main(){long long 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>

using namespace std;
typedef long long ll;
int main()
{
    ll n;
    cin >> n;
    ll sum = 0, tmp;
    for(int i = 0; i < n; i++) {
        cin >> tmp;
        sum += tmp;
    }
    cout << (sum / n) << endl;
}

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

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	int n;
	double a,b;
	cin>>n;
	cin>>a;
	b=a;
	for(int i=1;i<n;i++){
		cin>>a;
		b=b/(i+1)*i+a/(i+1);
	}
	int c=b;
	cout<<c<<endl;
    return 0;
}

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

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

main() {
  int n;
  double avg = 0.0;
  cin >> n;
  for(int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    avg = (avg*(i-1) + a)/i;
  }
  cout << (int)avg << endl;
}

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

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

C++: #include<iostream>
using namespace std;
int main(){
  int n,s[1000],i,j,b,av=0;
  cin >> n;
  for(i=1;i<=n;i++){
    cin >> s[i];
    av=s[i]+av;
  }
  cout << av/n << endl;
}

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

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

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



}

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

int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		int h,m;
		char _;
		cin>>h>>_>>m;
		h%=12;
		int d=abs(h*60+m-12*m);
		if(d<30*2){
			cout<<"alert\n";
		}else if(d<90*2){
			cout<<"warning\n";
		}else{
			cout<<"safe\n";
		}
	}
	return 0;
}

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


    return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;






int main() {
	ll n, s = 0, a;
	cin >> n;
	rep(i, n) {
		cin >> a;
		s += a;
	}
	s /= n;
	cout << s << 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/n;
    }
    printf("%d\n",sum);
    return 0;
}