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;
  double sum = 0.0,a;

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

  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int n;
	int kin[100000];
	int sum,avg;
	int i;
	sum=0;
	
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&kin[i]);
		sum=sum+kin[i];
	}
	avg=sum/n;
	printf("%d\n",avg);
	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;
	int sum = 0;
	cin>>n;
	rep(i, n){
		int x;
		cin>>x;
		sum +=x;
	}
	cout <<(sum)/n<<endl;
	return 0;
}

C++: sum = 0;
gets.to_i.times do 
  sum += gets.to_i
end

puts sum

C++: #include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
char a[8][8],b[8][8];
long long n;
long long sum;
long long num;
int main(){
	cin>>n;
	rep(i,n){
		cin>>num;
		sum+=num;
	}
	cout<<sum/n<<endl;

}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
using namespace std;
 
int main(){
   int n,i;
   long 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>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int main(){
	int n;
	cin >> n;
	long long int ans;
	for(int i = 0; i < n; i++){
        int a;
        scanf("%d",&a);
        ans += a;
	}
	printf("%lld\n",ans/n);
	return 0;
}

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

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

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

int main(){

	int n, m, sum;

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

	return 0;

}

C++: #include <bits/stdc++.h>

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

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

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

C++: #include <stdio.h>

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

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

C++: 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

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

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

C++: #include <iostream>

using namespace std;

int main()
{
	int n, m, k;

	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> k;
		m += k;
	}
	cout << m / 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 << (int)((double)s / n) << endl;
	}
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#define pb(in,tmp) in.push_back(tmp)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) loop(i,0,b)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
int main(){
  int n;
  long long int m=0;
  cin>>n;
  rep(i,n){
    int tmp;
	cin>>tmp;
	m+=tmp;
  }
  cout<<m/n<<endl;
}

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

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

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

	cout << sum / n << endl;

	return 0;
}

C++: #include<iostream>

int main()
{
	int n,expense=0;
	
	std::cin>>n;
	
	for(int i=0;i<n;i++)
	{
		int price;
		std::cin>>price;
		expense+=price;
	}
	expense/=n;
	std::cout<<expense<<std::endl;
	return 0;
}

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

C++: #include <iostream>
using namespace std;
int main(){int n;
  cin >> n;
  int ave = 0,m = n;
  while(n--){
    int a;
    cin >> a;
    ave += a;
   }
  cout << ave/m << endl;
}

C++: #include<stdio.h>

int main(){

int N;
int x;
long c=0;

scanf("%d",&N);

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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
	v.assign(a,vector<T>(b,t));
}

//v.erase(unique(v.begin(),v.end()),v.end());

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