#include #include #define rep(i,n) for(i=0;i o; // order int v; // value }; int main(void) { int i,j,k,l; int n; past_memory past[4]; cin >> n; rep(i,4) { past[i].v = 0; } for(i=1;i> v; e = 1; maxV = past[1].v; rep(j,2) { if(maxV < past[j+2].v + v) { maxV = past[j+2].v + v; e = j+2; } } past[0].v = maxV; past[0].o = past[e].o; if(e != 1) past[0].o.push_back(i); rep(j,3) { past[3-j] = past[3-j-1]; } } int e = 1; if(past[1].v < past[2].v) e = 2; cout << past[e].v << endl; printf("%d",past[e].o[0]); for(i=1;i