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<vector>
#include<string>
using namespace std;
int main() {
	int n;
	cin >> n;
	int sum = 0;
	for (int i = 0; i < n; i++){
		int a;
		cin >> a;
		sum += a;
	}
	cout << sum / n << endl;
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }

int n;
long long num;

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

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
using namespace std;
 
int main(){
   int n,i;
   long tmp,sum=0;
   long mean;
   cin>>n;
   for(i=0;i<n;i++){
       cin>>tmp;
        sum+=tmp;
   }
   mean=sum/6;
   cout<<mean<<endl;
    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
  int n;
  int rn[100000];
  unsigned long long ave=0;

  cin >> n;
  for(int i = 0 ; i < n ; i++) {
    cin >> rn[i];
    ave += rn[i];
  }
  ave /= n;
  cout << ave << endl;
  return 0;
}

C++: #include <iostream>

using namespace std;

int main() {

  int n;

  long int sum;


  cin >> n;

  sum=0;

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

    long int val;

    cin >> val;

    sum+=val;

  }

  cout << sum/n << endl;

  return 0;

}

C++: #include <iostream>

using namespace std;

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

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

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

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

int n;
double a[100010];

int main(){
	cin >> n;
	REP(i, n) cin >> a[i];
	double sum = 0;
	REP(i, n) sum += a[i];
	sum /= n;
	printf("%.lf\n", sum);
}

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;
}

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

C++: #include <stdio.h>

int main(void){
    int n;
    long long unsigned val;
    
    scanf("%d", &n);
    for (int i=0; i<n; i++){
        int tmp;
        scanf("%d", &tmp);
        val += tmp;
    }
    val /= n;
    printf("%d\n", val);
    
    return 0;
}

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

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

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
typedef long long int Int;

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

C++: #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<25;
const double pi=acos(-1);
const double eps=1e-8;
const vi emp;

int n;

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

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;

//typedef long long ll;
typedef __int64 ll;
int n,w[10000];

int main(){
	while(cin>>n){
		if(!n)return 0;
		for(int i=0;i<n;i++)cin>>w[i];
		sort(w,w+n);
		ll ans=0;
		for(int i=0;i<n;i++)ans+=w[i]*(n-1-i);
		printf("%I64d\n",ans);/*
		printf("%d\n",ans);
		__int64 a=1;
		printf("%d\n",a);
		__int64 b=100;
		printf("%d\n",b);
		char c[]="text";
		printf("%-.2s\n",c);
		printf("%.2s\n",c);
		printf("%-s\n",c);
		printf("%s\n",c);*/
	}
}

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

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