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

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

    return 0;
}

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

C++: #include <stdio.h>
int main() {int n,i,j=0,k;scanf("%d",&n);k=n;while (n--) scanf("%d",&i),j+=i;printf("%d\n",j/k);return 0;}

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

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

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

C++: #include <bits/stdc++.h>
using namespace std;
  
// #define int long long
#define pb push_back
#define print(Target) cout << Target << '\n'

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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef pair<int, int> pii;

bool is_uruu(int y) {return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0));}

signed main()
{
  ios::sync_with_stdio(false);
  ll sum = 0;
  int n;
  cin >> n;
  REP(i, n){
    ll m;
    cin >> m;
    sum += m;
  }
  print(sum / n);

  return (0);
}

C++: #include<bits//stdc++.h>
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 <stdio.h>

int main(void) {
	int i,n,buy,tbuy = 0;
	scanf ("%d",&n);
	for (i = 1;i <= n;i++){
		scanf("%d",&buy);
		tbuy = tbuy + buy;
	}
	printf("%d",tbuy / n);
	return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
  int n,i,j;
  long long s=0;
  cin >> n;
  for(i=0;i<n;i++){
    cin >> j;
    s += j;
  }
  cout << s / 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);
}

C++: #include<cstdio>
using namespace std;
main(){
  int n;
  scanf("%d",&n);
  int sum=0;
  for(int i=0;i<n;i++){
    int m;
    scanf("%d",&m);
    sum+=m;
  }
  printf("%d\n",sum/n);
}

C++: #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	int n;
	cin>>n;
	vi a(n);
	rep(i,n)
		cin>>a[i];
	cout<<accumulate(allof(a),0)/n<<endl;
	
	return 0;
}

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

int main(){
    Int sum = 0;
    Int kingaku;

    int n;
    cin >> n;

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

    return 0;
}

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

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

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

C++: #include <iostream>
using namespace std;
int main()
{
	int n, m = 0, s = 0, i;
	for (i = 0; i < n; i++)
	{
		cin >> m;
		s += m;
	}
	cout << s / 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;

int n,m;
long long s;

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

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

}

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

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

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

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

C++: #include<stdio.h>
int main(void)
{
	int n;
	int cnt[7];
	int i,j;
	double sin;
	
	scanf("%d",&n);
	for(i=1;i<=6;i++){
		cnt[i]=0;
	}
	for(i=1;i<=n;i++){
		scanf("%lf",&sin);
		if(sin<165.0){
			cnt[1]++;
		}
		else if(sin<170.0){
			cnt[2]++;
		}
		else if(sin<175.0){
			cnt[3]++;
		}
		else if(sin<180.0){
			cnt[4]++;
		}
		else if(sin<185.0){
			cnt[5]++;
		}
		else if(sin>=185.0){
			cnt[6]++;
		}
	}
	for(i=1;i<=6;i++){
		printf("%d:",i);
		for(j=1;j<=cnt[i];j++){
			printf("*");			
		}
	printf("\n");
	}
	return 0;
}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); i++ )
#define UREP( i, m, n ) for ( unsigned int i = (unsigned int)( m ); i < (unsigned int)( n ); i++ )
#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = (c).begin(); it != (c).end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define PB( n ) push_back( ( n ) )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define fst first
#define snd second

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

	int sum = 0;
	REP( i, 0, n )
	{
		int in;
		cin >> in;
		sum += in;
	}

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

	return 0;
}