import java.util.*;

public class ChainedMatrixMultiplication {
	static int min = Integer.MAX_VALUE;
	
	public static void main(String[] args){
		String input = "2\n3\n3 2\n2 4\n4 2\n"+
						"4\n20 2\n2 30\n30 12\n12 8\n";
						
		Scanner s = new Scanner(input);
		int cases = s.nextInt();
		for(int i=0;i<cases;i++){
			min = Integer.MAX_VALUE;
			int rows = s.nextInt();
			MatDim[] arr = new MatDim[rows];
			for(int r = 0;r<rows;r++){
				arr[r] = new MatDim( s.nextInt(), s.nextInt()); 
			}
			//printDim(arr);
			process(arr);
			System.out.println("minimum:" + min);
			
		}
		
	}
	
	public static void printDim(MatDim[] arr){
		for(int i=0;i<arr.length;i++)
			System.out.println( arr[i]);
	}
	public static void printArray(int[][] arr){		
		for(int i=0;i<arr.length;i++)
			System.out.println( java.util.Arrays.toString(arr[i]));
	}
		
	public static void process(MatDim[] iarr){
		//stopping condition for this recursive function
		if(iarr.length == 2){
			MatDim mm = MatDim.multiply(iarr[0],iarr[1]);			
			min = (int) Math.min( min,mm.total);
			return;
		}
		//reduce the number of matrices by choosing two and multiply them
		MatDim[] nArr = new MatDim[iarr.length - 1];		
		for(int i=0;i<iarr.length-1;i++){
			MatDim m = MatDim.multiply(iarr[i], iarr[i+1]);
			int j = 0;
			for(;j<i;j++)
				nArr[j] = iarr[j];
			nArr[j++]=  m;
			for(;j<nArr.length;j++)
				nArr[j] = iarr[j+1];		
			//recursively, take the new set of matrices and process it a gain
			process(nArr);
		}
	}
}

class MatDim{	
	int rows; // how many rows
	int cols; // how many columns
	int total; // how many elements
	
	public MatDim(int x, int y, int t){ 
		this.rows = x; 
		this.cols = y;		
		this.total =t;
	}
	public MatDim(int x, int y){
		this(x,y,0);
	}
	
	public String toString(){ 
		return "(" + rows + "," + cols + ")" + "-->" + total;
	}
	public static MatDim multiply(MatDim s1, MatDim s2){
		int r = s1.rows;
		int c = s2.cols;
		int t = r * s1.cols * c  + s1.total + s2.total;		
		return new MatDim(r,c,t);
	}
}