n = int(input())
v = list(map(int, input().split()))

dp = [0] * (n + 1)
if n >= 1:
    dp[1] = v[0]

for i in range(2, n + 1):
    dp[i] = max(dp[i-1], dp[i-2] + v[i-1])

selected = []
i = n
while i > 0:
    if dp[i] == dp[i-1]:
        i -= 1
    else:
        selected.append(i-1)
        i -= 2

selected = sorted([x + 1 for x in selected])

print(dp[n])
print(' '.join(map(str, selected)))