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>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	int n;
	cin>>n;
	int sum=0;
	rep(i,n){
		int a;cin>>a;sum+=a;
	}
	cout<<sum/n<<endl;
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
  int n,a;
  cin>>n;
  ll sum=0;
  for(int i=0;i<n;i++){
    cin>>a;
    sum+=a;
  }
  cout<<sum/n<<endl;
}

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

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

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

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

C++: #include<iostream>

using namespace std;

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

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

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

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<char,int> P;

static const double eps = 10e-9;

int main(){

	int n;
	while(~scanf("%d",&n)){
		double sum=0.0;
		for(int i=0;i<n;i++){
			double val;
			scanf("%lf",&val);
			sum += val/n;
		}

		printf("%.0lf\n",sum);
	}
}

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

using namespace std;

typedef long long ll;

int main()
{
    int n;
    ll sum = 0, tmp;

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

    return 0;
}

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

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

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

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

int main()
{
	int n;
	long 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>

using namespace std;

void solve()
{
	int n;
	cin >> n;
	unsigned long long int sum = 0;
	for(int i = 0; i < n; ++i)
	{
		int a;
		cin >> a;
		sum += a;
	}
	cout << sum / n << endl;
}

int main()
{
	solve();
	return(0);
}

C++: #include<stdio.h>
int main(void)
{
	int n;
	int kin[100000];
	long long int sum,avg;
	int i;
	sum=0;
	
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&kin[i]);
		sum=sum+kin[i];
	}
	avg=sum/n;
	printf("%d\n",avg);
	return 0;
}

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

#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _T template <typename T>
#define _HT template <typename H, typename... T>
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_T T in(int c){T n=0;bool m=false;while(isspace(c)){c=gcu();}if(c=='-')m=true,c=gcu();
	do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m?-n:n;}
_in() {return in<int>(gcu());}
_T T scan(T &n){int c=gcu();return c==EOF?false:(n=in<T>(c),true);}
_sc(char &c){c=gcu();gcu();return c!=EOF;}
#ifdef _GLIBCXX_STRING
_sc(string &s){int c;s="";
	for(;;){c=gcu();if(c=='\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}
#endif
_HT _sc(H &h, T&&... t){return scan(h)&&scan(t...);}
#define _vo _il void out
#define _vl _il void outl
_vo(bool b) {pcu('0'+b);}
_vo(const char *s){while(*s)pcu(*s++);}
_vo(char c){pcu(c);}
#ifdef _GLIBCXX_STRING
_vo(string s){for(char c:s)pcu(c);}
#endif
_T _vo(T n){static char buf[20];char *p=buf;
	if(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;
	while (p!=buf)pcu(*--p);}
_vl(){out('\n');}
#ifdef _GLIBCXX_VECTOR
_T _vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);outl();}
#endif
_HT _vo(H&& h, T&&... t){out(h);out(move(t)...);}
template <typename... T> _vl(T&&... t){out(move(t)...);outl();}

int main() {
	long n = in(), t = 0;
	for (int i = 0; i < n; i++)
		t += in();
	outl(t / n);
}

C++: #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <iterator>
 
using namespace std;
 
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
 
#define FOR(i,n) for(int i = 0; i < (n); i++)

typedef unsigned long long ull;

int main(){
	int n; cin>>n;
	ll sum = 0;
	FOR(i,n){ ll x; cin>>x; sum += x;}
	cout << sum / n << endl;

	return 0;
}

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

int main()
{
    int n, d;

    cin >> n;

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

    if( sum == 0 || n == 0 )
        cout << 0 << endl;
    else
        cout << sum / n << endl;

    return 0;
}

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

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

C++: #include<stdio.h>

int main(void){
	unsigned long long n,g,i,sum=0;

	scanf("%11d",&n);
	for(i=0;i<n;i++){
		scanf("%11d",&g);
		sum+=g;
	}
	printf("%11d\n",sum/n);
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl;
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int main() {
  int n;
  while(cin >> n) {
    ll sum=0;
    rep(i,n) {
      ll x;
      cin >> x;
      sum+=x;
    }
    pr(sum/n);
  }
  return 0;
}

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

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

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