// 2007アジア地区予選I : Most Distant Point from the Sea

#include <iostream>
#include <fstream>
#include <vector>
#include <complex>

using namespace std;

typedef complex<double> P;

const double EPS = 1e-8;

double cross(P a, P b) { return imag(conj(a)*b); }

vector<P> convexCut(const vector<P> &vp, P p, P q){
	vector<P> res;
	int n = vp.size();
	for(int i=0;i<n;i++){
		P A(vp[i]), B(vp[(i+1)%n]);
		double p1 = cross(q-p,A-p);
		double p2 = cross(q-p,B-p);
		if(p1 > -EPS) res.push_back(A);
		if(p1*p2 < -EPS)
			res.push_back(A+cross(q-p,q-A)/cross(q-p,B-A)*(B-A));
	}
	return res;
}

int main(){
	int n;
	fstream cin("I.in");
	while(cin >> n, n){
		vector<P> vp;
		for(int i=0;i<n;i++){
			int x, y; cin >> x >> y;
			vp.push_back(P(x,y));
		}
		double L = 0.0, R = 1e6;
		for(int cnt=0;cnt<200;cnt++){
			double mid = 0.5*(L+R);
			vector<P> cur = vp;
			for(int i=0;i<n;i++){
				P dir = P(0,1)*(vp[(i+1)%n]-vp[i]);
				dir = dir/abs(dir)*mid;
				cur = convexCut(cur, vp[i]+dir, vp[(i+1)%n]+dir); 
			}
			cur.empty() ? R = mid : L = mid;
		}
		printf("%.8lf\n", 0.5*(L+R));
	}
}