Превосходство
pragma GCC optimize("O2,O3,Ofast,unroll-loops")
pragma GCC target("sse,sse2,sse3,sse3,sse4,sse4.1,sse4.2,popcnt,lzcnt,abm,mmx,avx,avx2,fma,bmi,bmi2")
pragma GCC optimize("Ofast")
include <bits/stdc++.h>
include <ext/pbds/assoccontainer.hpp>
include <ext/pbds/treepolicy.hpp>
pragma GCC optimize ("O3")
pragma GCC target ("sse4")
// author : NUTELLA
typedef long double ld;
define ulli unsigned long long int
define p64 pair<ll,ll>
define pdd pair<double,double>
define v64 vector<ll>
define v32 vector<int>
define rforn(i,s) for(ll i = s; i >= 0; i--)
define ln "\n"
define dbg(x) cout<<#x<<" = "<<x<<ln
define pb push_back
define fi first
define se second
define time cerr<< "\nTime elapsed : "<<clock() * 1000.0/ CLOCKSPERSEC << "ms\n"
define p64 pair<ll,ll>
define pdd pair<double,double>
define lcm(a, b) ((a/gcd(a,b))*b)
define forn(i,n) for(int i=0 ; i<n; i++)
define forn2(i,n) for(int i=0 ; i<n/2; i++)
define forsn(i,s,n) for(ll i = s; i < n; i++)
define rforn(i,s) for(ll i = s; i >= 0; i--)
define rforsn(i,s,n) for(ll i = s; i >= n; i--)
define ln "\n"
define dbg(x) cout<<#x<<" = "<<x<<ln
define ll long long
define vint vector<int>
define vs vector<string>
define sint set<int>
define ss set<string>
define mint map<int, int>
define lb lower_bound
define ub upper_bound
define ins insert
define F first
define S second
define yes cout << "Yes\n"
define no cout << "No\n"
define ins insert
define MAX 1000007
define TADICONFIRE system("color 0A"); iosbase::syncwith_stdio(false); cin.tie(nullptr)
/** WRITEN BY YOU ░█████╗░░░░░░░░░░░░░░░ ██╔══██╗░░██╗░░░░██╗░░ ██║░░╚═╝██████╗██████╗ ██║░░██╗╚═██╔═╝╚═██╔═╝ ╚█████╔╝░░╚═╝░░░░╚═╝░░ ░╚════╝░░░░░░░░░░░░░░░
**/
define ull unsigned long long
define en "\n"
define pb push_back
define ll long long
define fr(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
define ld long double
define ull unsigned long long
define maximum 9223372036854775807
define minimum -maximum
define ld long double
define vll vector<long long>
define sz(x) (int)(x).size()
define MOD 1000000007
using namespace std; using namespace _gnupbds; typedef tree<int,nulltype,greater<int>,rbtreetag,treeorderstatisticsnode_update> indexed_set; void ikilik() {
string s="";
int a;
cin>>a;
while(a!=0)
{
if(a%2==1) s+='1';
else s+='0';
a/=2;
}
reverse(s.begin(),s.end());
cout<<s<<en;
} ll gcd(ll a,ll b) {
if (a==0)
return b;
return gcd(b % a, a);
} ll lcm(ll a,ll b) { return a/(__gcd(a,b))*b; } const int sz=2e5+5; const ll INF=0x3f3f3f3f3f3f3f3f; void solve() { ll n; cin>>n; ll a[n]; forn(i,n) cin>>a[i]; sort(a,a+n); ll ans=INT_MAX; forn2(i,n) if(a[i]+a[n-i-1]<ans) ans=a[i]+a[n-i-1]; cout<<ans; } signed main() { TADICONFIRE; //ll t; // cin>>t; //while(t--) //{ solve(); //} time; } // by _SAYADD