N = int(input())
V = list(map(int,input().split()))
dp = [[-1]*N for _ in range(2)]
v = V[0]
dp[0][0]=0
dp[1][0]=v
for i in range(N-1):
    
    v = V[i+1]
    dp[0][i+1] = max(dp[1][i],dp[0][i])
    dp[1][i+1] = dp[0][i]+v

M = max(dp[-1])
ans = []
now = M
x = N-1
while (now>0)&(x>=0):
    if dp[1][x]==now:
        ans.append(x+1)
        now -= V[x]
        x -= 1

        continue
    else:
        x -= 1
        continue

ans.reverse()
print(M)
print(*ans)