Problem: Luyi has n circles on the plane. The i-th circle is centered at (xi, yi). At the time zero circles start to grow simultaneously. In other words, the radius of each circle at time t (t > 0) is equal to t. The circles are drawn as black discs on an infinite white plane. So at each moment the plane consists of several black and white regions. Note that the circles may overlap while growing.

<image>

We define a hole as a closed, connected white region. For instance, the figure contains two holes shown by red border. During growing some holes may be created and it is easy to see that each created hole will disappear eventually. Luyi asks you to find moment of time such that the last hole disappears. In other words, you should find the first moment such that no hole can be seen after that.

Input

The first line of the input contains integer n (1 ≤ n ≤ 100). Each of the next n lines contains two integers xi and yi ( - 104 ≤ xi, yi ≤ 104), indicating the location of i-th circle.

It's guaranteed that no two circles are centered at the same point.

Output

Print the moment where the last hole disappears. If there exists no moment in which we can find holes print -1.

The answer will be considered correct if the absolute or relative error does not exceed 10 - 4.

Examples

Input

3
0 0
1 1
2 2


Output

-1


Input

4
0 0
0 2
2 2
2 0


Output

1.414214


Input

4
0 1
0 -1
-2 0
4 0


Output

2.125000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const double inf = 1e6, eps = 1e-8;
const double pi = acos(-1);
int n, tdn, ql, qr, qid[N], found;
double ans = -1, ds[123][123];
struct edge {
  int to, nx;
  double w;
} ee[N * 2];
int eq[N], en;
int vis[N], V;
double dep[N];
struct point {
  double x, y;
  void init() { scanf("%lf %lf", &x, &y); }
} p[N], sp[N];
point operator+(const point& a, const point& b) {
  return (point){a.x + b.x, a.y + b.y};
}
point operator-(const point& a, const point& b) {
  return (point){a.x - b.x, a.y - b.y};
}
point operator*(const point& a, const double& b) {
  return (point){a.x * b, a.y * b};
}
double cj(const point& a, const point& b) { return a.x * b.y - a.y * b.x; }
double dj(const point& a, const point& b) { return a.x * b.x + a.y * b.y; }
double dist(const point& a, const point& b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
point rot90(const point& a) { return (point){-a.y, a.x}; }
struct line {
  point p, v;
  double angle;
  int i;
  bool rig(const point& t) { return cj(v, t - p) <= 0; }
} td[N], que[N];
point intersec(line a, line b) {
  double t = cj(b.p - a.p, b.v) / cj(a.v, b.v);
  return a.p + a.v * t;
}
bool cmp_angle(const line& lz, const line& rz) { return lz.angle < rz.angle; }
void link(int u, int v, double w) {
  ee[++en] = (edge){v, eq[u], w}, eq[u] = en;
}
void dfs(int u, int pr) {
  vis[u] = V;
  for (int j = eq[u], v; v = ee[j].to, j; j = ee[j].nx)
    if (v != pr) {
      if (vis[v] == V) {
        if (fabs(dep[u] - dep[v] + ee[j].w) > eps) found = 1;
      } else {
        dep[v] = dep[u] + ee[j].w;
        dfs(v, u);
      }
    }
}
double getA(point v) { return atan2(v.y, v.x); }
double check(point cen) {
  double ret = inf;
  for (int i = 1; i <= n; ++i) {
    ret = min(ret, dist(cen, p[i]));
  }
  found = 0;
  for (int i = 1; i <= n; ++i) eq[i] = 0;
  en = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (i != j && fabs(cj(p[j] - p[i], cen - p[i])) > eps &&
          ds[i][j] < ret - eps) {
        double delta = getA(p[j] - cen) - getA(p[i] - cen);
        while (delta >= pi) delta -= 2 * pi;
        while (delta < -pi) delta += 2 * pi;
        link(i, j, delta);
      }
  ++V;
  dep[1] = 0;
  dfs(1, 0);
  return found ? ret : -1;
}
void solve(int o) {
  tdn = 0;
  td[++tdn] = (line){(point){-inf, -inf}, (point){1, 0}};
  td[++tdn] = (line){(point){inf, -inf}, (point){0, 1}};
  td[++tdn] = (line){(point){inf, inf}, (point){-1, 0}};
  td[++tdn] = (line){(point){-inf, inf}, (point){0, -1}};
  for (int i = 1; i <= n; ++i)
    if (i != o) {
      td[++tdn] = (line){(p[o] + p[i]) * 0.5, rot90(p[i] - p[o])};
      td[tdn].i = i;
    }
  for (int i = 1; i <= tdn; ++i) {
    td[i].angle = atan2(td[i].v.y, td[i].v.x);
  }
  sort(td + 1, td + tdn + 1, cmp_angle);
  que[ql = qr = 1] = td[1];
  qid[1] = td[1].i;
  for (int i = 2; i <= tdn; ++i) {
    while (ql < qr && td[i].rig(sp[qr - 1])) --qr;
    while (ql < qr && td[i].rig(sp[ql])) ++ql;
    if (fabs(cj(td[i].v, que[qr].v)) < eps) {
      continue;
    }
    que[++qr] = td[i];
    qid[qr] = td[i].i;
    sp[qr - 1] = intersec(que[qr - 1], que[qr]);
  }
  while (ql < qr - 1 && que[ql].rig(sp[qr - 1])) --qr;
  que[qr + 1] = que[ql];
  qid[qr + 1] = qid[ql];
  for (int i = ql; i <= qr; ++i)
    if (qid[i] && qid[i + 1]) {
      ans = max(ans, check(intersec(que[i], que[i + 1])));
    }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    p[i].init();
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      ds[i][j] = dist(p[i], p[j]) / 2;
    }
  for (int i = 1; i <= n; ++i) {
    solve(i);
  }
  if (ans < 0)
    printf("-1\n");
  else
    printf("%lf\n", ans);
}