#include <bits/stdc++.h>
int n;
double x, y, z;
double planet[200][3];
void read() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lf", &planet[i][0]);
    scanf("%lf", &planet[i][1]);
    scanf("%lf", &planet[i][2]);
  }
}
int main() {
  read();
  if (n == 1) {
    printf("%f %f %f", planet[0][0], planet[0][1], planet[0][2]);
    return 0;
  }
  x = y = z = 0;
  double fact = 1.0;
  for (int t = 0; t < 20000; t++) {
    int ind = 0;
    double maxDistance = -1;
    for (int i = 0; i < n; i++) {
      double distance = sqrt((planet[i][0] - x) * (planet[i][0] - x) +
                             (planet[i][1] - y) * (planet[i][1] - y) +
                             (planet[i][2] - z) * (planet[i][2] - z));
      if (distance > maxDistance) {
        maxDistance = distance;
        ind = i;
      }
    }
    x += fact * (planet[ind][0] - x);
    y += fact * (planet[ind][1] - y);
    z += fact * (planet[ind][2] - z);
    fact *= 0.999;
  }
  printf("%lf %lf %lf \n", x, y, z);
  return 0;
}
