#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N;
vector<ll> A;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif
    cin >> N;
    A = fetch_vec<ll>(N);
}

bool allnegative(vector<ll> a){
    bool res=true;
    for(auto x:a) res &= (x<0);
    return res;
}

int solve(){
    if(allnegative(A)){
        auto itr = max_element(A.begin(),A.end());
        cout << *itr << "\n";
        cout << N-1 << "\n";
        int n = itr-A.begin();
        int last=N;
        for (int i = 0; i < n; i++)
        {
            cout << 1 << "\n";
            last--;
        }
        for (int i = 0; i < N-1-n; i++)
        {
            cout << last << "\n";
            last--;
        }
        
        return 0;
    }

    ll ans1=0;
    ll ans2=0;
    for (int i = 0; i < N; i++)
    {
        if(i%2==0) ans2 += max(A[i],0LL);
        if(i%2==1) ans1 += max(A[i],0LL);
    }
    DBG(ans1)
    DBG(ans2)
    vector<int> res;
    vector<int> idx;
    for (int i = 0; i < N; i++) idx.push_back(i);
    ll ans=max(ans1,ans2);
    if(ans1>=ans2){
        for (int i = N-1; i >= 0; i--)
        {
            if(i%2==1) if(A[i]<0) {
                res.push_back(idx[i]);
                idx[i] = -1;
                if(i+1<N && i!=0) idx[i+1] = -1;
                if(i!=0) for (int k = i+2; k < N; k++) idx[k]-=2;
                else for (int k = i+1; k < N; k++) idx[k]-=1;                
                }
        }
        for (int i = N-1; i >= 0; i--)
        {
            if(i%2==0) {
                if(idx[i]<=-1) continue;
                res.push_back(idx[i]);
                idx[i] = -1;
                if(i+1<N && i!=0) idx[i+1] = -1;
                if(i!=0) for (int k = i+2; k < N; k++) idx[k]-=2;
                else for (int k = i+1; k < N; k++) idx[k]-=1;                
                }
        }        
        
    }
    else{
        for (int i = N-1; i >= 0; i--)
        {
            if(i%2==0) if(A[i]<0) {
                res.push_back(idx[i]);
                idx[i] = -1;
                if(i+1<N && i!=0) idx[i+1] = -1;
                if(i!=0) for (int k = i+2; k < N; k++) idx[k]-=2;
                else for (int k = i+1; k < N; k++) idx[k]-=1;                
                }
        }
        for (int i = N-1; i >= 0; i--)
        {
            if(i%2==1) {
                if(idx[i]<=-1) continue;
                res.push_back(idx[i]);
                idx[i] = -1;
                if(i+1<N && i!=0) idx[i+1] = -1;
                if(i!=0) for (int k = i+2; k < N; k++) idx[k]-=2;
                else for (int k = i+1; k < N; k++) idx[k]-=1;                
                }
        }        
        
    }
    cout << ans << "\n";
    cout << res.size() << "\n";
    for(auto r:res) cout << (r+1) << "\n";

    return 0;
}   

int main()
{
    input();
    solve();
    return 0;
}


Measured memory_bytes: 256