#include<stdio.h>#include<string.h>#include<math.h>#define MAXD 210#define zero 1e-8#define INF 10010struct point{ double x, y;}p[MAXD], wa[MAXD], wb[MAXD], *a, *b;int N, na, nb;double det(double x1, double y1, double x2, double y2){ return x1 * y2 - x2 * y1;}int dcmp(double x){ return fabs(x) < zero ? 0 : (x < 0 ? -1 : 1);}double sqr(double x){ return x * x;}void init(){ int i, j, k; for(i = 0; i < N; i ++) scanf("%lf%lf", &p[i].x, &p[i].y); p[N] = p[0];}void add(double x, double y){ b[nb].x = x, b[nb].y = y; ++ nb;}void cut(int k, double r){ int i, j; double x, y, t1, t2, dx, dy; point *t; nb = 0; t1 = sqrt(sqr(p[k + 1].x - p[k].x) + sqr(p[k + 1].y - p[k].y)); dx = (p[k + 1].y - p[k].y) / t1 * r, dy = (p[k].x - p[k + 1].x) / t1 * r; for(i = 0; i < na; i ++) { t1 = det(p[k + 1].x - p[k].x, p[k + 1].y - p[k].y, a[i].x + dx - p[k].x, a[i].y + dy - p[k].y); t2 = det(p[k + 1].x - p[k].x, p[k + 1].y - p[k].y, a[i + 1].x + dx - p[k].x, a[i + 1].y + dy - p[k].y); if(dcmp(t1) >= 0) add(a[i].x, a[i].y); if(dcmp(t1) * dcmp(t2) < 0) { x = (fabs(t2) * a[i].x + fabs(t1) * a[i + 1].x) / (fabs(t1) + fabs(t2)); y = (fabs(t2) * a[i].y + fabs(t1) * a[i + 1].y) / (fabs(t1) + fabs(t2)); add(x, y); } } t = a, a = b, b = t; na = nb; a[na] = a[0];}void solve(){ int i, j, k; double min, mid, max; min = 0, max = INF; for(k = 0; k < 100; k ++) { mid = (min + max) / 2; a = wa, b = wb; na = 4; a[0].x = -INF, a[0].y = -INF, a[1].x = INF, a[1].y = -INF, a[2].x = INF, a[2].y = INF, a[3].x = -INF, a[3].y = INF; a[na] = a[0]; for(i = 0; i < N; i ++) cut(i, mid); if(na == 0) max = mid; else min = mid; } printf("%.6lfn", mid);}int main(){ for(;;) { scanf("%d", &N); if(!N) break; init(); solve(); } return 0;}
