// Michael Do
// Solution to 2006 BHCSI Contest Problem Highlow.
import java.io.*;
import java.lang.*;
import java.util.*;

public class highlow{

	public static void main(String[] args) throws IOException{
		
		Scanner stdin = new Scanner(new File("highlow.in"));
		int currHeight, maxHeight, nextHeight, trips, surfaces;
		
		trips = stdin.nextInt();
		
		for(int i = 1;i <= trips;i++){
			
			surfaces = stdin.nextInt();
			currHeight = 0;
			maxHeight = 0;
			for(int j = 1;j <= surfaces;j++){
				
				nextHeight = stdin.nextInt();
				maxHeight = Math.max(Math.abs(nextHeight-currHeight), maxHeight);
				currHeight = nextHeight;
				
			}
			
			maxHeight = Math.max(Math.abs(currHeight), maxHeight);
			System.out.println("Climbing Trip #"+i+":");
			System.out.println("The highest cliff wall is "+maxHeight+" meters. ");
			System.out.println("I'm going to need "+(maxHeight*1.2)+" meters of rope.\n");
			
		}
		
		stdin.close();
		
	}

}