import java.util.Scanner;


public class Centroid {
	Scanner in = new Scanner(System.in);
	int currentCase = 1;
	
	public static void main( String[] args) {
		Centroid c = new Centroid();
		c.solveCases();
	}
	
	private void solveCases() {
		while(in.hasNext()) {
			int numpoints = in.nextInt();
			if (numpoints < 0) {
				break;
			}
			int[] xlist = new int[numpoints];
			int[] ylist = new int[numpoints];
			int[] mlist = new int[numpoints];
			for (int i = 0; i < numpoints; i ++ ){
				xlist[i]  = in.nextInt();
				ylist[i] = in.nextInt();
				mlist[i] = in.nextInt();
			}
			solve(xlist, ylist, mlist);
			currentCase += 1;
		}
	}
	
	public void solve(int[] xlist, int[] ylist, int[] mlist) {
		double xcoord; double ycoord;
		int msum = 0; int mysum  = 0; int mxsum = 0;
		
		for (int i = 0; i < xlist.length; i++) {
			mysum += ylist[i]*mlist[i];
			mxsum += xlist[i]*mlist[i];
			msum += mlist[i];
		}
		xcoord = (double)mxsum/(double)msum;
		ycoord = (double)mysum/(double)msum;
		
		System.out.printf("Case %d: %.2f %.2f\n", currentCase, xcoord, ycoord);
	}
}