n = int(input())
arr = list(map(int,input().split()))
arr.sort()
print(arr[n//2])#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define le (node<<1)
#define ri (node<<1|1)
#define mid ((l+r)>>1)
using namespace std;
const int N = 1e6+6 ;
const int M = 1e9+7 ;
const int oo = 1e18 ;
signed main()
{
//freopen( ".in" , "r" , stdin ) ;
//freopen( ".out" , "w" , stdout ) ;
fast ;
int n ;
cin >> n ;
int a[n] ;
for ( int i = 0 ; i < n ; i++ ) cin >> a[i] ;
sort ( a , a+n ) ;
cout << a[n/2] ;
//Plus_Ultra
return 0 ;
}
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |