Problem: The main land of Japan called Honshu is an island surrounded by the sea. In such an island, it is natural to ask a question: "Where is the most distant point from the sea?" The answer to this question for Honshu was found in 1996. The most distant point is located in former Usuda Town, Nagano Prefecture, whose distance from the sea is 114.86 km.

In this problem, you are asked to write a program which, given a map of an island, finds the most distant point from the sea in the island, and reports its distance from the sea. In order to simplify the problem, we only consider maps representable by convex polygons.



Input

The input consists of multiple datasets. Each dataset represents a map of an island, which is a convex polygon. The format of a dataset is as follows.


n
x1    y1
.
.
.
xn    yn


Every input item in a dataset is a non-negative integer. Two input items in a line are separated by a space.

n in the first line is the number of vertices of the polygon, satisfying 3 ≤ n ≤ 100. Subsequent n lines are the x- and y-coordinates of the n vertices. Line segments (xi, yi) - (xi+1, yi+1) (1 ≤ i ≤ n - 1) and the line segment (xn, yn) - (x1, y1) form the border of the polygon in counterclockwise order. That is, these line segments see the inside of the polygon in the left of their directions. All coordinate values are between 0 and 10000, inclusive.

You can assume that the polygon is simple, that is, its border never crosses or touches itself. As stated above, the given polygon is always a convex one.

The last dataset is followed by a line containing a single zero.

Output

For each dataset in the input, one line containing the distance of the most distant point from the sea should be output. An output line should not contain extra characters such as spaces.

The answer should not have an error greater than 0.00001 (10-5 ). You may output any number of digits after the decimal point, provided that the above accuracy condition is satisfied.

Example

Input

4
0 0
10000 0
10000 10000
0 10000
3
0 0
10000 0
7000 1000
6
0 40
100 20
250 40
250 70
100 90
0 70
3
0 0
10000 10000
5000 5001
0


Output

5000.000000
494.233641
34.542948
0.353553

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef complex<double> P;
typedef vector<P> Polygon;

double const EPS = 1e-7;
double const inf = 1e10;

struct Line : public vector<P>
{
  Line() {}
  Line(P const& a, P const& b) {
    push_back(a), push_back(b);
  }
  P vectorize() { return (*this)[1]-(*this)[0]; }
  double length() { return abs((*this)[1]-(*this)[0]); }
};

inline double dot(P const& a, P const& b) { return real(conj(a)*b); }
inline double cross(P const& a, P const& b) { return imag(conj(a)*b); }

enum { counter_clockwise = +1, clockwise = -1, cab_online = +2, abc_online = -2, on_segment = 0 };
int ccw(P a, P b, P c) {
  b -= a, c -= a;
  if(cross(b, c) > 0) return counter_clockwise;
  if(cross(b, c) < 0) return clockwise;
  if(dot(b, c) < 0) return cab_online;
  if(norm(b) < norm(c)) return abc_online;
  return on_segment;
}

typedef Line Segment;


P crosspoint(Line const& l, Line const& 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]; } // same line
  if(abs(A) < EPS) { return P(inf, inf); }
  return m[0] + B / A * (m[1]-m[0]);
}

// Notice: Return left part of the polygon.
Polygon convex_cut(Polygon const& G, Line const& l) {
  Polygon left_part;
  rep(i, G.size()) {
    P const& a = G[i], b = G[(i+1)%G.size()];
    Line const& ab = Line(a, b);
    if(ccw(l[0], l[1], a) != clockwise) { left_part.push_back(a); }
    if(ccw(l[0], l[1], a) * ccw(l[0], l[1], b) < 0) {
      P r = crosspoint(ab, l);
      if(r == P(inf, inf)) { continue; }
      left_part.push_back(r);
    }
  }
  return left_part;
}

// Notice: The border of the polygon in counterclockwise order.
bool able_polygon(Polygon const& G, double x) {
  int N = G.size();
  /*
    Polygon A;
    A.push_back(P(inf,inf)); A.push_back(P(-inf,inf));
    A.push_back(P(-inf,-inf)); A.push_back(P(inf,-inf));
  */
  Polygon A = {{-inf, -inf}, {inf, -inf}, {inf, inf}, {-inf, inf}};
  rep(i, N) {
    Line ln(G[i], G[(i+1)%N]);
    P shift = ln.vectorize()*polar(x/ln.length(), M_PI/2.);
    A = convex_cut(A, Line(G[i] + shift, G[(i+1)%G.size()] + shift));
  }
  return !A.empty();
}

double solve(Polygon const& G) {
  double L = 0., R = inf;
  rep(loop, 1000) {
    double M = (L+R) / 2.;
    if(able_polygon(G, M)) { L = M; }
    else { R = M; }
  }
  return L;
}

int main() {
  
  int N;
  while(cin >> N && N) {
    Polygon G(N);
    rep(i, N) {
      double x, y; cin >> x >> y;
      G[i] = P(x, y);
    }
    printf("%.8f\n", solve(G));
  }
  return 0;
}