N = int(input())
V = list(map(int, input().split()))
dp = [-1] * (N + 1)
dp[0] = 0
P = [-1] * (N + 1)
x = 0
for i in range(N):
    v = V[i]
    for j in reversed(range(max(1, i))):
        if dp[i + 1] < dp[j] + v:
            x = i + 1
            dp[i + 1] = dp[j] + v
            P[i + 1] = j
ans0 = max(dp)
x = dp.index(ans0)

ans = []
while x > 0:
    ans.append(x)
    x = P[x]
ans = ans[::-1]
print(ans0)
print(*ans)