#yuki258
n=int(raw_input())
v=list(map(int,raw_input().split()))
dp=[0 for i in range(n+1)]
for i in range(n):
 dp[i+1]=max(dp[i],dp[i-1]+v[i])
print dp[-1]

res=[]
i=n
while i>0:
 if dp[i]!=dp[i-1]:
  res.append(i)
  i-=2
 else:
  i-=1
res.sort()
for i in range(len(res)):
 print res[i],
print