////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
#include <type_traits>
#include <mutex>
#include <array>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
#define long long long

#define EPS 1e-9
#define INF (1L << 28)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

#define PRED(a,exp) [&](const auto & a) -> bool { return exp; }
#define COMP(a,b,exp) [&](const auto & a, const auto & b) -> bool { return exp; }

inline int sign_of(double x) { return abs(x) < EPS ? 0 : x > 0 ? 1 : -1; }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

//// i/o helper ////

namespace std {
	template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
	template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
}
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; v.reserve(n); REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; v.reserve(n); REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T> struct iter_pair_t { T beg, end; };
template <class T> iter_pair_t<T> iter_pair(T beg, T end) { return iter_pair_t<T>{beg, end}; }
template <class T> ostream & operator << (ostream &out, const iter_pair_t<T> &v)
{
	std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));
	return out;
}
template <class T1> ostream & operator << (ostream &out, const vector<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1> ostream & operator << (ostream &out, const set<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1, class T2> ostream & operator << (ostream &out, const map<T1, T2> &v) { return out << iter_pair(begin(v), end(v)); }

struct _Reader { istream &cin; template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { ostream &cout; bool f{ false }; template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__
#define WRITE(...) (_Writer{cout}), __VA_ARGS__; cout << '\n'
#define DEBUG(...) (_Writer{cerr}), __VA_ARGS__; cerr << '\n'

void solve();
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);

	//auto temp = ctype<char>::classic_table();
	//vector<ctype<char>::mask> bar(temp, temp + ctype<char>::table_size);
	//bar[':'] |= ctype_base::space;
	//cin.imbue(locale(cin.getloc(), new ctype<char>(bar.data())));

	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << setprecision(std::numeric_limits<double>::max_digits10);
	solve();

	return 0;
}

// 2D GEOMETORY //

// 平面上の点。もしくは平面上のベクトル。
struct P2
{
	double x, y;
	P2(double x = 0, double y = 0) : x(x), y(y) { }
	P2 operator +() const { return *this; }
	P2 operator +(const P2 &_) const { return P2(x + _.x, y + _.y); }
	P2 operator -() const { return P2(-x, -y); }
	P2 operator -(const P2 &_) const { return *this + -_; }
	P2 operator *(double _) const { return P2(x*_, y*_); }
	P2 operator /(double _) const { return P2(x / _, y / _); }
	double dot(const P2 &_) const { return x * _.x + y * _.y; } // 内積
	double cross(const P2 &_) const { return x * _.y - y * _.x; } // 外積
	double sqlength() const { return x * x + y * y; } // 二乗長さ
	double length() const { return sqrt(sqlength()); } // 長さ
	P2 orthogonal() const { return P2(y, -x); }
	P2 direction() const { return *this / length(); } // 方向ベクトル
	double arg() const { return atan2(y, x); }
};
inline istream & operator>>(istream & in, P2 & p) { in >> p.x >> p.y; return in; }
inline ostream & operator<<(ostream & out, const P2 & p) { out << p.x << ' ' << p.y; return out; }

/// 直線
struct Line
{
	P2 p, d; // 始点・方向
	explicit Line(P2 pos = P2(), P2 dir = P2()) : p(pos), d(dir) { }
	static Line FromPD(P2 pos, P2 dir) { return Line(pos, dir); }
	static Line From2Point(P2 a, P2 b) { return Line(a, b - a); }
};

/// 線分
struct LineSeg
{
	P2 p, d; // 始点・方向大きさ
	explicit LineSeg(P2 pos = P2(), P2 dir = P2()) : p(pos), d(dir) { }
	static LineSeg FromPD(P2 pos, P2 dir) { return LineSeg(pos, dir); }
	static LineSeg From2Point(P2 a, P2 b) { return LineSeg(a, b - a); }
	operator Line() { return Line(p, d); }
};

// 交点
inline P2 crossPoint(Line a, Line b) { return a.p + a.d * (b.d.cross(b.p - a.p) / b.d.cross(a.d)); }

typedef vector<P2> Polygon;

pair<Polygon, Polygon> cutConvexPolygon(const Polygon &polygon, const Line &cut)
{
	int N = polygon.size();
	Polygon left, right;
	REP(i, N)
	{
		P2 p0 = polygon[i];
		P2 p1 = polygon[(i + 1) % N];
		int d1 = sign_of(cut.d.cross(p1 - cut.p)); // -1:cw, 0:on, 1:ccw
		int d0 = sign_of(cut.d.cross(p0 - cut.p)); // -1:cw, 0:on, 1:ccw

		if (d0 == 0) // p0 on cut line
		{
			left.push_back(p0);
			right.push_back(p0);
		}
		else  // p0 and p1 are the same side.
		{
			if (d0 < 0)
			{
				left.push_back(p0);
			}
			else
			{
				right.push_back(p0);
			}

			if (d0 * d1 < 0)
			{
				P2 splitPoint = crossPoint(Line::From2Point(p0, p1), cut);
				left.push_back(splitPoint);
				right.push_back(splitPoint);
			}
		}
	}

	if (left.size() < 3) { left.clear(); }
	if (right.size() < 3) { right.clear(); }
	return { left, right };
}


////////////////////
/// template end ///
////////////////////

void solve()
{
	while (true)
	{
		READ(int, N);
		if (!N) { break; }

		auto polygon = read<P2>(N);

		// 削れる陸の距離をにぶたんで探す。
		double l = 0.0, r = 10000.0, m;

		while (abs(l - r) >= 0.0000001)
		{
			m = (r - l) / 2 + l; // 陸を削る

			Polygon poly = polygon;
			REP(i,N)
			{
				LineSeg cutLine = LineSeg::From2Point(polygon[i], polygon[(i + 1) % N]);
				cutLine.p = cutLine.p + -cutLine.d.orthogonal().direction() * m; // 辺に垂直な方向に m だけ動かした直線。
				poly = cutConvexPolygon(poly, cutLine).second;
			}

			//DEBUG(m);
			bool ok = poly.size() > 0; // 陸地がちょっとでも残ってればOK

			if (ok)
			{
				l = m;
			}
			else
			{
				r = m;
			}
		}

		//WRITE(m);
		printf("%16.16f\n", m);
	}
}



Measured memory_bytes: 3228