Time Limit: 5000 MS    Memory Limit: 65536 K 


Description

The Croatian version of this contest has the following rules: ¡°Each round of the contest consists of 8 tasks with different point values. Every contestant may solve any of the tasks they choose. However, the contestant¡¯s final score will be the sum of points earned on any 5 tasks such that this sum is maximized.¡± Since the organizers were busy coming up with interesting problems for the contest (and translating them), they¡¯ve simply forgotten to solve the problem of determining the points scored by each contestant. Now they are kindly asking you to do it for them. Write a program that, given the number of points earned by a contestant on each task, determines the total amount of points scored by that contestant, as well as the sorted list of the 5 problems counting towards that score. No contestant will ever score the same amount of points on two different problems.

Input

Input consists of 8 lines. Each line of input contains a single positive integer X (0 ¡Ü X ¡Ü 150), where the number X in row i denotes the number of points earned by the contestant on problem i. All 8 numbers X will be distinct.

Output

The first line of output must contain the total amount of points scored by the contestant. The second line of output must contain indices of the 5 problems counting towards the total score, sorted in ascending order, separated by single spaces. Problem indices are positive integers from 1 to 8, inclusive.

Sample Input

20 30 50 48 33 66 0 64 20 0 50 80 77 110 56 48 20 30 50 80 110 11 0 85

Sample Output

261 3 4 5 6 8 373 3 4 5 6 7 355 2 3 4 5 8

Source

coci 2011/2012 contest2