#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vvi> vvvi;
typedef vector<vvl> vvvl;
set<ll> s;
vector<ll> res;
long long int findMaxAttraction(int n, int start, int d,int attraction[]){
if(start==0){
multiset<ll> S;
unordered_map<ll,ll> M;
ll act=1;
ll act2=d-act;
for(int i=0;i<=act2;i++){
if(i>=n){
break;
}
M[attraction[i]]++;
S.insert(attraction[i]);
}
if(d>=n){
act=(d-n);
}
if(d-n>=n){
ll suma=0;
for(int i=0;i<n;i++){
suma+=attraction[i];
}
return suma;
}
res[act]=*prev(S.end());
while(act+1<=(d-(act+1))+1){
act++;
act2=d-act;
S.erase(attraction[act2+1]);
M[attraction[act2+1]]--;
if(M[attraction[act2+1]]>=1){
for(int i=0;i<M[attraction[act2+1]];i++){
S.insert(attraction[act2+1]);
}
}
auto it=prev(S.end());
ll ans=0;
for(int i=0;i<act;i++){
ans+=*it;
it=prev(it);
}
res[act]=ans;
}
ll caca=0;
for(auto x:res){
if(x>caca){
caca=x;
}
}
return caca;
}else{
return 1;
}
}
