Problem: The Galaxy contains n planets, there are many different living creatures inhabiting each planet. And each creature can get into troubles! Space rescuers know it perfectly well and they are always ready to help anyone who really needs help. All you need to do is call for them. 

Now the space rescuers plan to build the largest in the history of the Galaxy rescue station; however, the rescue station's location is yet to be determined. As some cases are real emergencies, the rescuers want to find such a point in the Galaxy from which it would be possible to get to the remotest planet in the minimum possible time. In other words, the rescuers need such point in the space that the distance between it and the planet remotest from it was minimal (if we compare this point with all other possible points in the space). Unfortunately, the rescuers can't sole this problem.

As the planets are quite remote from each other, they can be considered as points in Euclidean three-dimensional space. The distance between points (xi, yi, zi) and (xj, yj, zj) can be calculated by the formula <image>. The rescue station can be positioned in any point in the space. It can also coincide with some planet. 

Galaxy is in danger! Save the space rescuers and find the required point for them.

Input

The first line of the input file contains integer n — the number of planets (1 ≤ N ≤ 100). Each of the following n lines contains information about the planets. The i-th line contains three integers xi, yi, zi — the coordinates of the i-th planet ( - 104 ≤ xi, yi, zi ≤ 104, 1 ≤ i ≤ n). No two planets coincide.

Output

Print on the first line of the output file three space-separated real numbers x0, y0, z0 — the coordinates for the future base. If there are several solutions, you are allowed to print any of them. The answer will be accepted if the distance from this point to the remotest planet will differ from the juries' variant in no more than 10 - 6 in absolute or relative value.

Examples

Input

5
5 0 0
-5 0 0
0 3 4
4 -3 0
2 2 -2


Output

0.000 0.000 0.000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 2e2 + 5;
using namespace std;
const double eps = 1e-7;
struct Point {
  double x, y, z;
  Point(double x = 0, double y = 0, double z = 0) : x(x), y(y), z(z){};
  double dis(const Point &b) const {
    return sqrt((x - b.x) * (x - b.x) + (y - b.y) * (y - b.y) +
                (z - b.z) * (z - b.z));
  }
  void input() { scanf("%lf%lf%lf", &x, &y, &z); }
} p[N];
int n;
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  return x > 0 ? 1 : -1;
}
double cal(Point a) {
  double dis = 0;
  for (int i = 1; i <= n; i++) {
    if (sgn(dis - a.dis(p[i])) < 0) dis = max(dis, a.dis(p[i]));
  }
  return dis;
}
double ll = -1e4, rr = 1e4;
double search_z(double l, double r, double x, double y) {
  double mid, midmid;
  while (r - l > eps) {
    mid = l + (r - l) / 2;
    midmid = mid + (r - mid) / 2;
    if (cal(Point(x, y, mid)) > cal(Point(x, y, midmid)))
      l = mid;
    else
      r = midmid;
  }
  return mid;
}
double search_y(double l, double r, double x) {
  double mid, midmid;
  while (r - l > eps) {
    mid = l + (r - l) / 2;
    midmid = mid + (r - mid) / 2;
    double z1 = search_z(ll, rr, x, mid), z2 = search_z(ll, rr, x, midmid);
    if (cal(Point(x, mid, z1)) > cal(Point(x, midmid, z2)))
      l = mid;
    else
      r = midmid;
  }
  return mid;
}
double search_x(double l, double r) {
  double mid, midmid;
  while (r - l > eps) {
    mid = l + (r - l) / 2;
    midmid = mid + (r - mid) / 2;
    double y1 = search_y(ll, rr, mid), y2 = search_y(ll, rr, midmid);
    double z1 = search_z(ll, rr, mid, y1), z2 = search_z(ll, rr, midmid, y2);
    if (cal(Point(mid, y1, z1)) > cal(Point(midmid, y2, z2)))
      l = mid;
    else
      r = midmid;
  }
  return mid;
}
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    p[i].input();
  }
  double x = search_x(ll, rr);
  double y = search_y(ll, rr, x);
  double z = search_z(ll, rr, x, y);
  printf("%.10lf %.10lf %.10lf\n", x, y, z);
}
void TIME() {
  clock_t start, finish;
  double totaltime;
  start = clock();
  solve();
  finish = clock();
  totaltime = (double)(finish - start) / CLOCKS_PER_SEC;
}
int main() {
  TIME();
  return 0;
}