#include <bits/stdc++.h>
double x[10000], y[10000], z[10000];
int main() {
  double tmp, mi, ma, xx, yy, zz, q;
  int n, i, j, k;
  while (scanf("%d", &n) == 1) {
    xx = yy = zz = 0;
    q = 0.1;
    for (i = 0; i < n; i++) {
      scanf("%lf%lf%lf", &x[i], &y[i], &z[i]);
      xx += x[i];
      yy += y[i];
      zz += z[i];
    }
    xx /= n;
    yy /= n;
    zz /= n;
    for (i = 0; i < 20000; i++) {
      ma = -1;
      for (j = 0; j < n; j++)
        if ((tmp = ((x[j] - xx) * (x[j] - xx)) + ((y[j] - yy) * (y[j] - yy)) +
                   ((z[j] - zz) * (z[j] - zz))) > ma) {
          ma = tmp;
          k = j;
        }
      xx += (x[k] - xx) * q;
      yy += (y[k] - yy) * q;
      zz += (z[k] - zz) * q;
      q *= 0.9993;
    }
    printf("%.8lf %.8lf %.8lf\n", xx, yy, zz);
  }
}
