def solve():
    N = int(input())
    V = list(map(int, input().split()))

    dp = [0] * (N + 1)

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

    print(dp[N])

    eats = []

    i = N
    while i > 0:
        if dp[i] != dp[i - 1]:
            eats.append(i)
            i -= 2
        else:
            i -= 1

    eats.sort()
    print(' '.join(str(e) for e in eats))


if __name__ == '__main__':
    solve()