#include <bits/stdc++.h>
using namespace std;
int n;
double x[200][3];
double c[3];
double f() {
  double ma = -1;
  for (int i = 0; i < n; i++) {
    double sum = 0;
    for (int j = 0; j < 3; j++) sum += ((x[i][j] - c[j]) * (x[i][j] - c[j]));
    ma = max(ma, sum);
  }
  return ma;
}
double ts(int k) {
  if (k == 3)
    return f();
  else {
    double l = -1e4, r = 1e4;
    while (r - l > 1e-8) {
      double a = l + (r - l) / 3;
      double b = l + (r - l) * 2 / 3;
      c[k] = a;
      double testa = ts(k + 1);
      c[k] = b;
      double testb = ts(k + 1);
      if (testa > testb)
        l = a;
      else
        r = b;
    }
  }
  return f();
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < 3; j++) cin >> x[i][j];
  ts(0);
  for (int i = 0; i < 3; i++) cout << c[i] << ' ';
}
