A convex polygon consisting of N vertices is given. The coordinates of each vertex are represented counterclockwise by (X1, Y1), (X2, Y2), ……, (XN, YN). No matter what straight line passes through the point P, find the coordinates of the point P so that the areas of the two convex polygons obtained after cutting are equal.

Constraints

* All inputs are integers

* 3 ≤ N ≤ 50

* 0 ≤ | Xi |, | Yi | ≤ 1000000

* The input polygon is a simple convex polygon.

* The output must satisfy max (| X-cX |, | Y-cY |) ≤ 0.0001 when the output coordinates are (X, Y) and the exact solution is (cX, cY).

Input

The input is given in the following format.

> N
> X1 Y1
> X2 Y2
> ……
> XN YN
>

Output

If there is a point that satisfies the condition of the problem statement, the coordinates of that point

> X Y
>

Output in the format of. If the point does not exist, output "NA" on one line.

Examples

Input

4
100 100
0 100
0 0
100 0


Output

50.00000 50.00000


Input

3
100 100
0 100
0 0


Output

NA
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-8;
const double PI = acos(-1);
int sgn(double a, double b = 0) {
  return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;
}
double sqr(double a) { return sqrt(max(a, (double)0)); }
struct Point {
  double add(double a, double b) {
    if (abs(a + b) < EPS * (abs(a) + abs(b))) return 0;
    return a + b;
  }
  double x, y;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  Point operator+(Point p) { return Point(add(x, p.x), add(y, p.y)); }
  Point operator-(Point p) { return Point(add(x, -p.x), add(y, -p.y)); }
  Point operator*(double d) { return Point(x * d, y * d); }
  Point operator/(double d) { return Point(x / d, y / d); }
  bool operator==(Point p) { return !sgn(dist(p)); }
  bool operator<(Point p) const { return (p.x != x) ? x < p.x : y < p.y; }
  double norm() { return sqr(x * x + y * y); }
  double dist(Point a) { return (*this - a).norm(); }
  double dot(Point a) { return x * a.x + y * a.y; }
  double cross(Point a) { return x * a.y - y * a.x; }
  Point rotate(double r, Point p = Point(0, 0)) {
    double ta = cos(r) * (x - p.x) - sin(r) * (y - p.y) + p.x;
    double tb = sin(r) * (x - p.x) + cos(r) * (y - p.y) + p.y;
    return Point(ta, tb);
  }
  double arg() {
    if (sgn(x) > 0) return atan(y / x);
    if (sgn(x) < 0) return atan(y / x) + PI;
    if (sgn(y) > 0) return PI / 2;
    if (sgn(y) < 0) return 3 * PI / 2;
    return 0;
  }
};
int ccw(Point a, Point b, Point c) {
  b = b - a;
  c = c - a;
  if (b.cross(c) > 0) return +1;
  if (b.cross(c) < 0) return -1;
  if (b.dot(c) < 0) return +2;
  if (b.norm() < c.norm()) return -2;
  return 0;
}
struct Line {
  Point a, b;
  Line() {}
  Line(Point a, Point b) : a(a), b(b) {}
  bool on(Point c) { return abs(ccw(a, b, c)) != 1; }
  double dist(Point c) { return abs((b - a).cross(c - a)) / (b - a).norm(); }
  bool isOrthogonal(Line l) { return (a - b).dot(l.a - l.b) == 0.0; }
  bool isParallel(Line l) { return (a - b).cross(l.a - l.b) == 0.0; }
  bool isIntersection(Line l) { return !((a - b).cross(l.a - l.b) == 0.0); }
};
struct Segment : public Line {
  Segment() {}
  Segment(Point a, Point b) : Line(a, b) {}
  bool on(Point c) { return ccw(a, b, c) == 0; }
  bool on(Line l) { return l.on(a) && l.on(b); }
  bool overlap(Segment s) {
    return isParallel(s) && (on(s.a) || on(s.b) || s.on(a) || s.on(b));
  }
  bool isParallel(Segment s) { return (a - b).cross(s.a - s.b) == 0.0; }
  double dist(Point c) {
    if ((b - a).dot(c - a) < EPS) return c.dist(a);
    if ((a - b).dot(c - b) < EPS) return c.dist(b);
    return abs((b - a).cross(c - a)) / b.dist(a);
  }
  bool isIntersection(Line l) {
    return (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0);
  }
  bool isIntersection(Segment s) {
    return (ccw(a, b, s.a) * ccw(a, b, s.b) <= 0 &&
            ccw(s.a, s.b, a) * ccw(s.a, s.b, b) <= 0);
  }
  Point intersectionPoint(Segment s) {
    Point q = s.b - s.a;
    double d1 = abs(q.cross(a - s.a));
    double d2 = abs(q.cross(b - s.a));
    double t = d1 / (d1 + d2);
    return a + (b - a) * t;
  }
  Point intersectionPoint(Line l) {
    if (isIntersection(l)) {
      return intersectionPoint(Segment(l.a, l.b));
    }
    cout << "came" << endl;
  }
};
struct Polygon {
  vector<Point> v;
  Polygon() {}
  Polygon(int n) { v.resize(n); }
  Polygon(vector<Point> v) : v(v) {}
  void resize(int n) { v.resize(n); }
  double area() {
    double area = 0;
    for (int i = 0; i < v.size(); i++)
      area += (v[(i) % v.size()].x - v[(i + 1) % v.size()].x) *
              (v[(i) % v.size()].y + v[(i + 1) % v.size()].y);
    return abs(area) / 2.0;
  }
  Polygon convexCut(Line l) {
    vector<Point> res;
    for (int i = 0; i < v.size(); i++) {
      Point a = v[(i) % v.size()], b = v[(i + 1) % v.size()], p = l.b - l.a;
      if (ccw(l.a, l.b, a) != -1) res.push_back(a);
      if (sgn(p.cross(a - l.a) * p.cross(b - l.a)) < 0)
        res.push_back(Segment(a, b).intersectionPoint(l));
    }
    return res;
  }
};
double maxx, maxy;
Polygon pol;
double f(double x) {
  Polygon l = pol.convexCut(Line(Point(x, 0), Point(x, maxy)));
  Polygon r = pol.convexCut(Line(Point(x, maxy), Point(x, 0)));
  return abs(l.area() - r.area());
}
double f2(double y) {
  Polygon l = pol.convexCut(Line(Point(0, y), Point(maxx, y)));
  Polygon r = pol.convexCut(Line(Point(maxx, y), Point(0, y)));
  return abs(l.area() - r.area());
}
const int maxLoop = 72;
double searchX(double l, double r) {
  for (int loop = 0; loop < maxLoop; loop++) {
    if (f((l * 2 + r) / 3) > f((l + r * 2) / 3))
      r = (l + r * 2) / 3;
    else
      l = (l * 2 + r) / 3;
  }
  return (l + r) / 4;
}
double searchY(double l, double r) {
  for (int loop = 0; loop < maxLoop; loop++) {
    if (f2((l * 2 + r) / 3) > f2((l + r * 2) / 3))
      r = (l + r * 2) / 3;
    else
      l = (l * 2 + r) / 3;
  }
  return (l + r) / 4;
}
int main(void) {
  int n;
  cin >> n;
  pol.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> pol.v[i].x >> pol.v[i].y;
    maxx = max(maxx, pol.v[i].x);
    maxy = max(maxy, pol.v[i].y);
  }
  Point res = Point(searchX(0, maxx), searchY(0, maxy));
  bool can = true;
  for (int i = 0; i < 1000; i++) {
    for (int j = 0; j << pol.v.size(); j++) {
      pol.v[j] = pol.v[j].rotate(0.0001, res);
    }
    can &= f(res.x) < EPS;
  }
  if (can)
    printf("%.5f %.5f\n", res.x, res.y);
  else
    cout << "NA" << endl;
  return 0;
}
