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

    dp = [[0] * (N + 1) for _ in range(2)]

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

    s = 0 if dp[0][N] > dp[1][N] else 1

    print(dp[s][N])

    eats = []

    for i in range(N, 0, -1):
        if s:
            eats.append(i)
            s = 0
        else:
            if dp[0][i - 1] == dp[0][i]:
                s = 0
            else:
                s = 1

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


if __name__ == '__main__':
    solve()