public void solve() throws IOException {
    int n;
    int num = 1;
    while ((n = nextInt()) != 0) {
      Member[] members = new Member[n];
      for (int x = 0; x < n; x++) {
        members[x] = new Member(nextInt(), nextInt());
      }
      Arrays.sort(members, XCOMP);
      int xco = members[n/2].xco;
      Arrays.sort(members, YCOMP);
      int yco = members[n/2].yco;
      
      long total = 0;
      for (int x = 0; x < n; x++) {
        total += Math.abs(members[x].xco - xco);
        total += Math.abs(members[x].yco - yco);
      }
      System.out.format("Case %d: (%d,%d) %d%n", num, xco, yco, total);
      num++;
    }
  }