import java.util.Scanner;

/**
 * Created by jordanly on 4/20/15.
 */
public class Centroid_Points {
    public static Scanner in = new Scanner(System.in);
    public static int counter = 1;

    public static void main(String[] args) {
        while (in.hasNext()) {
            solve();
        }
    }

    public static void solve() {
        int n = in.nextInt();
        if (n < 0) return;

        int[] x = new int[n];
        int[] y = new int[n];
        int[] m = new int[n];

        for (int i = 0; i < n; i++) {
            x[i] = in.nextInt();
            y[i] = in.nextInt();
            m[i] = in.nextInt();
        }

        int xSum = 0;
        int ySum = 0;
        int mSum = 0;
        for (int i = 0; i < n; i++) {
            xSum += (x[i] * m[i]);
            ySum += (y[i] * m[i]);
            mSum += m[i];
        }

        double cX = ((double) xSum/(double) mSum);
        double cY = ((double) ySum/(double) mSum);

        System.out.printf("Case %d: %.2f %.2f\n", counter, cX, cY);
        counter++;
    }
}