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++: /*
	0134:Exit Survery
*/
#include	<iostream>

using namespace std;

int main(void) {
	int w;
	__int64 ave, sum = 0;
	
	cin >> w;
	for(int i = 0; i < w; i++) {
		int bu;
		
		cin >> bu;
		sum += bu;
	}
	ave = sum / w;
	cout << ave << endl;
	
	return 0;
}

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


	return 0;
}

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

C++: #include<stdio.h>
#include<math.h>

typedef unsigned long long int INT;
int main()
{
	while(1)
	{
		int i,n;
		INT sum=0;
		if(1!=scanf("%d",&n))break;
		if(n<=0)break;
		for(i=0;i<n;++i){
			int t;
			scanf("%d",&t);
			sum+=t;
		}
		printf("%u\n",(int)floor(sum/(double)n));
	}
	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 / 6 << endl;

    return 0;
}

C++: #include <iostream>

using namespace std;

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

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

using namespace std;

#define rep(i,a) for(int i = 0 ; i < a ; i ++)

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

C++: #include <stdio.h>

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

C++: #include <iostream>

using namespace std;

int main(){
	int n, money, total, ans;

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

	cout << ans << endl;

	return 0;
}

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

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

  cout << sum/n << endl;
}

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

C++: #include<iostream>
int main()
{
	long long int n,i,s=0,t;
	std::cin>>n;
	for(i=0;i<n;++i)
		std::cin>>t,s+=t;
	std::cout<<s/n<<'\n';
	return 0;
}

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

int main(){
    int n,mn;
    double ave=0;
    
    cin >> n;
    
    int i;
    for(i = 0 ; i < n ; i++){
        cin >> mn;
        ave += mn;
    }
    
    printf("%.0f\n" ,ave/=i);
    
    return 0;
}

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

using namespace std;

int main()
{
	while(true)
	{
		int n;
		int sum=0;
		cin>>n;
		if(n==0||cin.eof())break;
		for(int i=0;i<n;++i){
			int t;cin>>t;sum+=t;
		}
		cout<<(int)floor(sum/(double)n)<<'\n';
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
  int n;
  int rn[100000];
  int 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,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/n << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  long long n,p=0,s,t;
  cin>>n;t=n;
  while(n--)cin>>s,p+=s;
  cout<<p/t<<endl;
}

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

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

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

	return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#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>
#include <functional>
#include <cctype>

using namespace std;

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

int main()
{
	int n;
	int sum = 0;
	int temp;

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

C++: #include<iostream>
using namespace std;
int main(){
long n,i,p,s1,s2;
cin>>n;
for(s1=s2=i=0;i<n;i++){
cin>>p;
s1+=p/n;
s2+=p%n;
}
cout<<s1+s2/n<<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(){
    long long int a,n,s=0,i;
    for(cin>>n,i=0;i++-n;){
        cin>>a;
        s += a;
    }
    cout << (int)((double)s/n) << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int n,a,total;

int main(void){

  total = 0;
  cin >> n;

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