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;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
void O(T t) {
  cout << t << endl;
}
const ll mod = 1e9 + 7;
constexpr ll inf = ((1 << 30) - 1) * 2 + 1;
const double EPS = 1e-8;
const double INF = 1e12;
typedef complex<double> P;
namespace std {
bool operator<(const P &a, const P &b) {
  return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
}
bool sorty(const P &a, const P &b) {
  return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);
}
bool same(const P &a, const P &b) {
  P p = a - b;
  if (abs(real(p)) < EPS && abs(imag(p)) < EPS) {
    return true;
  }
  return false;
}
}  // namespace std
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
double dot(const P &a, const P &b) { return real(conj(a) * b); }
struct L : public vector<P> {
  L(){};
  L(const P &a, const P &b) {
    push_back(a);
    push_back(b);
  }
};
struct C {
  P p;
  double r;
  C(){};
  C(const P &p, double r) : p(p), r(r) {}
};
int ccw(P a, P b, P c) {
  b -= a;
  c -= a;
  if (cross(b, c) > 0) return +1;
  if (cross(b, c) < 0) return -1;
  if (dot(b, c) < 0) return +2;
  if (norm(b) < norm(c)) return -2;
  return 0;
}
int linejudge(const L &ab, const L &cd) {
  P a = ab[1] - ab[0], b = cd[1] - cd[0];
  if (abs(cross(a, b)) < EPS) {
    return 2;
  } else if (abs(dot(a, b)) < EPS) {
    return 1;
  }
  return 0;
}
bool intersectLL(const L &l, const L &m) {
  return abs(cross(l[1] - l[0], m[1] - m[0])) > EPS ||
         abs(cross(l[1] - l[0], m[0] - l[0])) < EPS;
}
bool intersectLS(const L &l, const L &s) {
  return cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0]) <
         EPS;
}
bool intersectLP(const L &l, const P &p) {
  return abs(cross(l[1] - p, l[0] - p)) < EPS;
}
bool intersectSS(const L &s, const L &t) {
  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&
         ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;
}
bool intersectSP(const L &s, const P &p) {
  return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;
}
P projection(const L &l, const P &p) {
  double t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);
  return l[0] + t * (l[0] - l[1]);
}
P reflection(const L &l, const P &p) {
  return p + 2.0 * (projection(l, p) - p);
}
double distanceLP(const L &l, const P &p) { return abs(p - projection(l, p)); }
double distanceLL(const L &l, const L &m) {
  return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);
}
double distanceLS(const L &l, const L &s) {
  if (intersectLS(l, s)) return 0;
  return min(distanceLP(l, s[0]), distanceLP(l, s[1]));
}
double distanceSP(const L &s, const P &p) {
  const P r = projection(s, p);
  if (intersectSP(s, r)) return abs(r - p);
  return min(abs(s[0] - p), abs(s[1] - p));
}
double distanceSS(const L &s, const L &t) {
  if (intersectSS(s, t)) return 0;
  return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),
             min(distanceSP(t, s[0]), distanceSP(t, s[1])));
}
double distancePP(const P &p, const P &q) { return abs(p - q); }
P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0];
  if (abs(A) < EPS) assert(false);
  return m[0] + B / A * (m[1] - m[0]);
}
P verticalvector(const P &a, const P &b) {
  if (a.real() == b.real()) {
    return {1.0, 0};
  }
  if (a.imag() == b.imag()) {
    return {0, 1.0};
  }
  P p = a - b;
  P res = {-p.imag(), p.real()};
  return res / abs(p);
}
double calc_triangle(P a, P b, P c) {
  P ba = (b - a);
  P ca = (c - a);
  return (real(ba) * imag(ca) - imag(ba) * real(ca)) / 2.0;
}
double calc_area(const vector<P> &g) {
  double res = 0;
  for (int i = 0; i < (int)(g.size() - 2); ++i) {
    res += calc_triangle(g[0], g[(i + 1) % g.size()], g[(i + 2) % g.size()]);
  }
  return res;
}
vector<P> convex_cut(vector<P> &g, L &l) {
  vector<P> h;
  for (int i = 0; i < (int)((int)g.size()); ++i) {
    P p = g[i], q = g[(i + 1) % g.size()];
    if (ccw(p, q, l[0]) == 0 && ccw(p, q, l[1]) == 0) {
      if (ccw(p, l[1], l[0]) == 0)
        return g;
      else
        return vector<P>{};
    }
    if (ccw(l[0], l[1], p) != -1) h.emplace_back(p);
    if (ccw(l[0], l[1], p) * ccw(l[0], l[1], q) < 0)
      h.emplace_back(crosspoint(L(p, q), l));
  }
  return h;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  vector<P> g;
  P gp = P(0, 0);
  double x, y;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> x >> y;
    g.push_back(P(x, y));
    gp = gp + P(x, y);
  }
  gp = gp / (1.0 * n);
  random_device rnd;
  mt19937 mt(rnd());
  for (int i = (0); i < (int)(n * n); ++i) {
    P a(mt() % 1000000, mt() % 1000000);
    L ab(a, gp), ba(gp, a);
    vector<P> t = convex_cut(g, ab);
    vector<P> u = convex_cut(g, ba);
    double T = calc_area(t), U = calc_area(u);
    if (abs(T - U) >= EPS) {
      cout << "NA" << endl;
      return 0;
    }
  }
  cout << fixed << setprecision((10)) << real(gp) << ' ' << imag(gp) << endl;
  return 0;
}
