import java.util.*;
public class Main{
public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    if(!sc.hasNextInt()){
        System.out.print("Invalid input");
        return;
    }
    int n=sc.nextInt();
    if(n<=0){
         System.out.print("Invalid input");
        return;
    }
    int[] jobid=new int[n];
    int[] deadline=new int[n];
    int[] profit=new int[n];
    for(int i=0;i<n;i++){
         if(!sc.hasNextInt()){
        System.out.print("Invalid input");
        return;
    }
    jobid[i]=sc.nextInt();
    if(jobid[i]<=0){
        System.out.print("Invalid input");
        return;
    } 
    if(!sc.hasNextInt()){
        System.out.print("Invalid input");
        return;
    }
    deadline[i]=sc.nextInt();
    if(deadline[i]<=0){
        System.out.print("Invalid input");
        return;
    }
    if(!sc.hasNextInt()){
        System.out.print("Invalid input");
        return;
    }
    profit[i]=sc.nextInt();
    if(profit[i]<=0){
        System.out.print("Invalid input");
        return;
    }
    }
    //bubble sort
    for(int i=0;i<n;i++){
        for(int j=0;j<n-i-1;j++){
            if(profit[j]<profit[j+1]){
                int temp=profit[j];
                profit[j]=profit[j+1];
                profit[j+1]=temp;
                
                temp=deadline[j];
                deadline[j]=deadline[j+1];
                deadline[j+1]=temp;
                
                temp=jobid[j];
                jobid[j]=jobid[j+1];
                jobid[j+1]=temp;
            }
        }
    }
    int maxdeadline=deadline[0];
    for(int fmd:deadline){
        if(maxdeadline<fmd){
            maxdeadline=fmd;
        }
    }
    int slot[]=new int[maxdeadline+1];
    for(int i=0;i<=maxdeadline;i++){
        slot[i]=-1;
        
    }
        int top=0;
        for(int i=0;i<n;i++){
            for(int j=maxdeadline;j>0;j--){
                if(slot[j]==-1){
                    slot[j]=jobid[i];
                    totaljobid+=jobid[i];
                    top+=profit[i];
                    break;
                }
            }
        }
        for(int i=0;i<n;i++){
            if(jobid[i])
            System.out.print(jobid[i]+" ");
        }
         System.out.println();
         System.out.println(top);
    }
}