#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; h f[4]; int v,e; cin >> n; rep(i,4) { f[i].v = 0; } for(i=1;i> v; e = 1; g = f[1].v; rep(j,2) { if(g < f[j+2].v + v) { g = f[j+2].v + v; e = j+2; } } f[0].v = g; f[0].o = f[e].o; if(e != 1) f[0].o.push_back(i); rep(j,3) { f[3-j] = f[3-j-1]; } } e = 1; if(f[1].v < f[2].v) e = 2; cout << f[e].v <