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>
using namespace std;
int main()
{
	int n, a, s, i;
	cin >> n;
	for (i = s = 0; i < n; i++)
	{
		cin >> a;
		s += a;
	}
	cout << s / n << endl;
}

C++: #include <iostream>
using namespace std;
typedef long long int ll;

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

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

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

int main(){

	int n, m;
	long long sum = 0;
	
	cin >> n;
	
	for(int i=0; i<n; i++){
		cin >> m;
		sum += m;
	}
	int result = floor((double)sum / n);
	cout << result << endl;

	return 0;

}

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

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

int main(){
	int n;
	long long int money = 0;
	int input;

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

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const double INF = 1e9;

struct edge{int to,cost;};
typedef pair<int,int> P;//firstは最短距離,secondは頂点番号


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

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

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

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

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

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

int main(){
    int n,c;
    long long ave = 0;
    
    cin >> n;
    for(int i = 0 ; i < n ; i++){
        cin >> c;
        ave += c;
    }
    cout << (int)(ave/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];
	int sum(0);
	rep(i, 0, n)sum += v[i];
	cout << sum / n << endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

int n,m;
__int64 s=0;

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

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;
  int sum=0;
  rep(i,n){
    cin>>v;
    sum+=v;
  }
  cout<<sum/n<<endl;
}

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

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