Problem: You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.

You can choose a real number D and move each vertex of the polygon a distance of at most D from their original positions.

Find the maximum value of D such that no matter how you move the vertices, the polygon does not intersect itself and stays convex.

Input

The first line has one integer n (4 ≤ n ≤ 1 000) — the number of vertices.

The next n lines contain the coordinates of the vertices. Line i contains two integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — the coordinates of the i-th vertex. These points are guaranteed to be given in clockwise order, and will form a strictly convex polygon (in particular, no three consecutive points lie on the same straight line).

Output

Print one real number D, which is the maximum real number such that no matter how you move the vertices, the polygon stays convex.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely, let's assume that your answer is a and the answer of the jury is b. The checker program will consider your answer correct if <image>.

Examples

Input

4
0 0
0 1
1 1
1 0


Output

0.3535533906


Input

6
5 0
10 0
12 -4
10 -8
5 -8
3 -4


Output

1.0000000000

Note

Here is a picture of the first sample

<image>

Here is an example of making the polygon non-convex.

<image>

This is not an optimal solution, since the maximum distance we moved one point is  ≈ 0.4242640687, whereas we can make it non-convex by only moving each point a distance of at most  ≈ 0.3535533906.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;

public class D {
	public static void main(String[] args) throws IOException {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out= new PrintWriter(System.out);
		int n= in.nextInt();
		long [] x= new long[n];
		long [] y= new long[n];
		for (int i = 0; i < y.length; i++) {
			x[i]= in.nextInt();
			y[i]= in.nextInt();
		}
		double res= Double.MAX_VALUE;
		for (int i = 0; i < y.length; i++) {
			long [] a= {x[i], y[i]};
			long [] c= {x[(i+1)%n], y[(i+1)%n]};
			long [] b= {x[(i+2)%n], y[(i+2)%n]};
			res= Math.min(res, linepolong(a,b,c));
		}
		res/=2.0;
		System.out.println(res);
		
		
	}
	public static double linepolong(long [] a, long [] b, long [] c){
		double dist = cross(a,b,c) / dist(a,b);
        long dot1 = dot(a,b,c);
        if(dot1 > 0)return dist(b,c);
        long dot2 = dot(b,a,c);
        if(dot2 > 0)return dist(a,c);
        return Math.abs(dist);
	}
	public static double dist(long [] a, long [] b){
		long d1 = a[0] - b[0];
        long d2 = a[1] - b[1];
        return Math.sqrt(d1*d1+d2*d2);
	}
	public static long dot(long [] a, long [] b, long [] c){
		long [] ab = new long[2];
        long [] bc = new long[2];
        ab[0] = b[0]-a[0];
        ab[1] = b[1]-a[1];
        bc[0] = c[0]-b[0];
        bc[1] = c[1]-b[1];
        long dot = ab[0] * bc[0] + ab[1] * bc[1];
        return dot;
	}
	public static double cross(long [] a, long[] b, long [] c){
		long [] ab = new long[2];
        long [] ac = new long[2];
        ab[0] = b[0]-a[0];
        ab[1] = b[1]-a[1];
        ac[0] = c[0]-a[0];
        ac[1] = c[1]-a[1];
        long cross = ab[0] * ac[1] - ab[1] * ac[0];
        return cross;
	}
	

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}
		public String next() throws IOException {
			if(!st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
				return next();
			}
			return st.nextToken();
		}
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
	}
}