Little Janet likes playing with cubes. Actually, she likes to play with anything whatsoever, cubes or tesseracts, as long as they are multicolored. Each cube is described by two parameters — color ci and size si. A Zebra Tower is a tower that consists of cubes of exactly two colors. Besides, the colors of the cubes in the tower must alternate (colors of adjacent cubes must differ). The Zebra Tower should have at least two cubes. There are no other limitations. The figure below shows an example of a Zebra Tower.

<image>

A Zebra Tower's height is the sum of sizes of all cubes that form the tower. Help little Janet build the Zebra Tower of the maximum possible height, using the available cubes.

Input

The first line contains an integer n (2 ≤ n ≤ 105) — the number of cubes. Next n lines contain the descriptions of the cubes, one description per line. A cube description consists of two space-separated integers ci and si (1 ≤ ci, si ≤ 109) — the i-th cube's color and size, correspondingly. It is guaranteed that there are at least two cubes of different colors.

Output

Print the description of the Zebra Tower of the maximum height in the following form. In the first line print the tower's height, in the second line print the number of cubes that form the tower, and in the third line print the space-separated indices of cubes in the order in which they follow in the tower from the bottom to the top. Assume that the cubes are numbered from 1 to n in the order in which they were given in the input.

If there are several existing Zebra Towers with maximum heights, it is allowed to print any of them. 

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.

Examples

Input

4
1 2
1 3
2 4
3 3


Output

9
3
2 3 1 


Input

2
1 1
2 1


Output

2
2
2 1 
import java.io.*;
import java.util.*;
import java.math.*;

public class Tower {
    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer st;
    static Random rnd;
    
    static int[] colors = new int[100000], sizes = new int[100000];
    static int[] temp = new int[100000], uniqueColors;
    static ArrayList<Pair>[] sizesByColor = new ArrayList[100000];
    static long[][] sumOnPrefix = new long[100000][];
    static TreeSet<Pair>[] setsByLen = new TreeSet[100005];
    
    static int longCompare(long a, long b) {
    	if(a == b)
    		return 0;
    	
    	return (a > b) ? 1 : -1;
    }
    
    static class Pair implements Comparable<Pair> {
    	long len;
    	int id;
    	
		public Pair(long len, int id) {
			this.len = len;
			this.id = id;
		}
    	
    	public int compareTo(Pair p) {
    		if(len != p.len)
    			return longCompare(len, p.len);
    		
    		return id - p.id;
    	}
    }
    
    
    static void calcUniqueColors(int n) {
    	for(int i = 0; i < n; i++)
    		temp[i] = colors[i];
    	
    	Arrays.sort(temp, 0, n);
    	
    	int count = 1;
    	
    	for(int i = 1; i < n; i++)
    		if(temp[i] != temp[i - 1])
    			++count;
    	
    	uniqueColors = new int[count];
    	uniqueColors[0] = temp[0];
    	count = 1;
    	
    	for(int i = 1; i < n; i++)
    		if(temp[i] != temp[i - 1])
    			uniqueColors[count++] = temp[i];
    }
    
    static Pair getBest(int len, int color) {
    	Pair inf = new Pair(Long.MIN_VALUE / 3, -1);
    	
    	if(setsByLen[len] == null || setsByLen[len].size() == 0)
    		return inf;
    	
    	Pair highest = setsByLen[len].last();
    	
    	if(highest.id != color)
    		return highest;
    	
    	if(setsByLen[len].size() == 1)
    		return inf;
    	
    	return setsByLen[len].lower(highest);
    }
    
    static void construct(int fiColor, int fiLen, int seColor, int seLen) {
    	if(seLen > fiLen) {
    		construct(seColor, seLen, fiColor, fiLen);
    		return;
    	}
    	
    	boolean flag = true;
    	int fiPointer = 0, sePointer = 0;
    	
    	while(fiLen > 0 || seLen > 0) {
    		if(flag) {
    			out.print(sizesByColor[fiColor].get(fiPointer++).id);
    			--fiLen;
    		} else {
    			out.print(sizesByColor[seColor].get(sePointer++).id);
    			--seLen;
    		}
    		
    		if(fiLen > 0 || seLen > 0)
    			out.print(' ');
    		
    		flag = !flag;
    	}
    	
    	out.print('\n');
    	
    }
    
    static void solve() throws IOException {
    	int n = nextInt();
    	//int n = 100000;

    	for(int i = 0; i < n; i++) {
    		colors[i] = nextInt();
    		sizes[i] = nextInt();
    		//colors[i] = 1;
    		//sizes[i] = rnd.nextInt(1000000000) + 1;
    		sizesByColor[i] = new ArrayList<Pair>();
    		setsByLen[i + 1] = new TreeSet<Tower.Pair>();
    	}
    	
    	calcUniqueColors(n);
    	
    	int m = uniqueColors.length;
    	
    	for(int i = 0; i < n; i++) {
    		colors[i] = Arrays.binarySearch(uniqueColors, colors[i]);
    		sizesByColor[colors[i]].add(new Pair(sizes[i], i + 1));
    	}
    	
    	for(int i = 0; i < m; i++) {
    		Collections.sort(sizesByColor[i]);
    		Collections.reverse(sizesByColor[i]);
    	}
    	
    	for(int color = 0; color < m; color++) {
    		int howMuch = sizesByColor[color].size();
    		
    		sumOnPrefix[color] = new long[howMuch + 1];
    		long current = 0;
    		
    		for(int i = 1; i <= howMuch; i++) {
    			current += sizesByColor[color].get(i - 1).len;
    			sumOnPrefix[color][i] = current;
    			setsByLen[i].add(new Pair(current, color));
    		}
    	}
    	
    	long bestRes = -1;
    	int bestResColorFirst = -1, bestResColorSecond = -1;
    	int bestResLenFirst = -1, bestResLenSecond = -1;
    	
    	for(int color = 0; color < m; color++) {
    		int howMuch = sizesByColor[color].size();
    		
    		for(int i = 1; i <= howMuch; i++) {
    			long current = sumOnPrefix[color][i];
    			
    			for(int j = i - 1; j <= i + 1; j++) {
    				Pair best = getBest(j, color);
    				
    				if(current + best.len > bestRes) {
    					bestRes = current + best.len;
    					bestResColorFirst = color;
    					bestResColorSecond = best.id;
    					bestResLenFirst = i;
    					bestResLenSecond = j;
    				}
    			}
    		}
    	}
    	
    	out.println(bestRes);
    	out.println(bestResLenFirst + bestResLenSecond);
    	construct(bestResColorFirst, bestResLenFirst, bestResColorSecond, bestResLenSecond);
    }
    
    public static void main(String[] args) {
        try {
            final String className = Tower.class.getName().toLowerCase();

            try {
                in = new BufferedReader(new FileReader(className + ".in"));
                out = new PrintWriter(new FileWriter(className + ".out"));
            } catch (FileNotFoundException e) {
                in = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(System.out);
            }
            
            rnd = new Random();

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
            System.exit(42);
        }
    }

    static String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = in.readLine();

            if (line == null)
                return null;

            st = new StringTokenizer(line);
        }

        return st.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}