extern crate core;

use std::fmt;
use std::cmp::{Ordering, min, max};
use std::fmt::{Display, Error, Formatter, Binary};
use std::f32::MAX;
use std::ops::{Add, Sub, Mul, Div, Neg, Index, IndexMut};
use std::collections::{BTreeMap, VecDeque, BinaryHeap, BTreeSet};

fn show<T: Display>(vec: &Vec<T>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        print!("[{}", vec[0]);
        for i in 1 .. vec.len() {
            print!(", {}", vec[i]);
        }
        println!("]");
    }
}
fn show2<T: Display>(vec: &Vec<Vec<T>>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        for l in vec {
            show(l);
        }
    }
}
macro_rules! read_line{
    () => {{
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).ok();
        line
    }};
    (delimiter: ' ') => {
        read_line!().split_whitespace().map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (delimiter: $p:expr) => {
        read_line!().split($p).map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (' ') => {
        read_line!(delimiter: ' ')
    };
    ($delimiter:expr) => {
        read_line!(delimiter: $delimiter)
    };
    (' '; $ty:ty) => {
        read_line!().split_whitespace().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
    ($delimiter:expr; $ty:ty) => {
        read_line!($delimiter).into_iter().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
}
macro_rules! read_value{
    () => {
        read_line!().trim().parse().ok().unwrap()
    }
}
macro_rules! let_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}
macro_rules! let_mut_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let mut $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}
const EPSILON: f64 = 0.000000001;
#[derive(Copy, Clone)]
struct Point {
    x: f64, y: f64
}
impl Point {
    fn distance(&self, other: &Self) -> f64 {
        ((self.x - other.x) * (self.x - other.x) + (self.y - other.y) * (self.y - other.y)).sqrt()
    }
}
impl Sub for Point {
    type Output = Vector;
    fn sub(self, rhs: Self) -> Self::Output {
        Vector{x: self.x - rhs.x, y: self.y - rhs.y}
    }
}
#[derive(Copy, Clone)]
struct Line {
    a: f64, b: f64, c: f64
}
impl Line {
    fn by_two_point(a: &Point, b: &Point) -> Line {
        Line{a: a.y - b.y, b: b.x - a.x, c: a.x * b.y - a.y * b.x}
    }
    fn is_parallel(&self, other: &Self) -> bool {
        (self.a * other.b - self.b * other.a).abs() < EPSILON
    }
    fn cross_point(&self, other: &Self) -> Option<Point> {
        let d = self.a * other.b - self.b * other.a;
        if d.abs() < EPSILON {
            None
        }else {
            Some(Point { x: (self.b * other.c - self.c * other.b) / d, y: (self.c * other.a - self.a * other.c) / d })
        }
    }
    fn cathetus(&self, point: &Point) -> Line {
        Line{a: self.b, b: -self.a, c: self.a * point.y - self.b * point.x}
    }
}
#[derive(Copy, Clone)]
struct Triangle {
    a: Point, b: Point, c: Point
}
impl Triangle {
    fn area(&self) -> f64 {
        let a = self.a.distance(&self.b);
        let b = self.b.distance(&self.c);
        let c = self.c.distance(&self.a);
        let s = (a + b + c) / 2_f64;
        (s * (s - a) * (s - b) * (s - c)).sqrt()
    }
    fn inner_circle_radius(&self) -> f64 {
        self.area() * 2_f64 / (self.a.distance(&self.b) + self.b.distance(&self.c) + self.c.distance(&self.a))
    }
    fn by_three_edges(a: &Edge, b: &Edge, c: &Edge) -> Option<Triangle> {
        if Triangle::can_make_triangle(a, b, c) {
            let la = Line::by_two_point(&a.from, &a.to);
            let lb = Line::by_two_point(&b.from, &b.to);
            let lc = Line::by_two_point(&c.from, &c.to);
            Some(Triangle{a: la.cross_point(&lb).unwrap(), b: lb.cross_point(&lc).unwrap(), c: lc.cross_point(&la).unwrap()})
        }else {
            None
        }
    }
    fn can_make_triangle(a: &Edge, b: &Edge, c: &Edge) -> bool {
        let va = a.to - a.from;
        let vb = b.to - b.from;
        let vc = c.to - c.from;
        va.cross(&vb) > 0_f64 && vb.cross(&vc) > 0_f64 && vc.cross(&va) > 0_f64
    }
}
#[derive(Copy, Clone)]
struct Edge {
    from: Point, to: Point
}
impl Edge {
    fn is_parallel(&self, other: &Self) -> bool {
        let Vector{x: ax, y: ay} = self.to - self.from;
        let Vector{x: bx, y: by} = other.to - other.from;
        (ax * by - ay * bx).abs() < EPSILON
    }
    fn distance_if_parallel(&self, other: &Self) -> Option<f64> {
        if self.is_parallel(other) {
            let sl = Line::by_two_point(&self.from, &self.to);
            let ol = Line::by_two_point(&other.from, &other.to);
            Some(Line::cathetus(&sl, &self.from).cross_point(&ol).unwrap().distance(&self.from))
        }else {
            None
        }
    }
}
#[derive(Copy, Clone)]
struct Vector {
    x: f64, y: f64
}
impl Vector {
    fn cross(&self, other: &Self) -> f64 {
        self.x * other.y - self.y * other.x
    }
}
fn main() {
    loop {
        let_all!(n: usize);
        if n == 0 {
            return
        }
        let mut points = Vec::with_capacity(n);
        for _ in 0 .. n {
            let_all!(x: f64, y: f64);
            points.push(Point{x: x, y: y});
        }
        let mut edges = Vec::with_capacity(n);
        edges.push(Edge{from: points[n - 1], to: points[0]});
        for i in 1 .. n {
            edges.push(Edge{from: points[i - 1], to: points[i]});
        }
        let mut min_r = std::f64::MAX;
        for i in 0 .. n {
            for j in 0 .. i {
                if let Some(d) = edges[i].distance_if_parallel(&edges[j]) {
                    if min_r > d / 2_f64 {
                        min_r = d/ 2_f64;
                    }
                }else {
                    for k in 0..j {
                        if let Some(t) = Triangle::by_three_edges(&edges[k], &edges[j], &edges[i]) {
                            let r = t.inner_circle_radius();
                            if min_r > r {
                                min_r = r;
                            }
                        }
                    }
                }
            }
        }
        println!("{:.*}", 10, min_r);
    }
}


Measured memory_bytes: 5060