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;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);

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

  return 0;
}

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() {

  long long int sum=0, n;

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

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

int main(){

 long long int n,ans = 0,m;

  cin >> n;

  for(int i=0;i<n;i++){
    cin >> m;

    ans += m;
  }

  cout << ans/n << endl;

}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()

int main()
{
    int n;
    double d,sum;
    cin >> n;
    REP(n){ cin >> d; sum+= d;}

    cout << (int)(sum/n) << endl;

    return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int n, m, s, i;
	while (cin >> n)
	{
		if (cin.eof()) break;
		m = s = 0;
		for (i = 0; i < n; i++)
		{
			cin >> m;
			s += m;
		}
		cout << s / n << endl;
	}
}

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

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

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

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

    return 0;
}

C++: #include<iostream>
using namespace std;
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)

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

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

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)

typedef long long ll;

int main() {
	int n;
	cin >> n;
	
	ll sum = 0;
	REP(i, n) {
		int in;
		scanf("%d", &in);
		sum += in;
	}
	cout << sum / n << endl;
	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

//#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

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

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

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

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

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

int main(){
	int j;
	double a,s,n;
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> a;
		s+=a/n;
	}
	j=s;
	cout << j << "\n";
	
	
return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#define int long long
#define rep(i, n) for (int i=0; i<n; i++)
#define REP(n) rep(i, n)
using namespace std;

int n, p, sum = 0;

signed main()
{
    cin >> n;

    REP(n)
    {   
        cin >> p;
        sum += p;
    }   

    sum /= n;

    cout << sum << endl;

    return 0;
}

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

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

C++: #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

signed main() {
	int n; cin >> n;
	vector<int>v(n); rep(i, 0, n)cin >> v[i];
	cout << accumulate(v.begin(), v.end(), 0) / n << endl;
	return 0;
}

C++: #include<stdio.h>

int main(void){
	unsigned long long int 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 <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
int main()
{
	int n;
	cin >> n;
	ll sum;
	for(int i=0;i<n;i++)
	{
		int k;
		cin >> k;
		sum+=k;
	}
	cout << sum/n << endl;
	return 0;
}