import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.awt.geom.*;

public class jeroen_ternary {
	static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	static Point2D[] pts;

	public static void main(String[] args) throws Exception {
		// Read input
		int n = Integer.valueOf(in.readLine());
		pts = new Point2D[n];
		for(int i = 0; i < n; i++) {
			String[] ps = in.readLine().split(" ");
			pts[i] = new Point2D.Double(Integer.valueOf(ps[0]), Integer.valueOf(ps[1]));
		}

		// Ternary search for the best angle
		double low = 0;
		double high = Math.PI / 2;
		for(int i = 0; i < 50; i++) {
			double a1 = (low + low + high) / 3;
			double a2 = (low + high + high) / 3;
			if(withAngle(a1) < withAngle(a2))
				high = a2;
			else
				low = a1;
		}
		System.out.println(withAngle((low+high)/2));
	}

	static double withAngle(double angle) {
		// Precompute distances between pairs of places
		int n = pts.length;
		double[][] dist = new double[n][n];
		AffineTransform rot = AffineTransform.getRotateInstance(-angle);
		for(int i = 0; i < n; i++) {
			for(int j = i + 1; j < n; j++) {
				// Construct the vector between the two points, rotate it with the angle,
				// and then the distance is dx + dy. And since everything is rotationally
				// symmetric we simply take the absolute values.
				Point2D v = new Point2D.Double(pts[i].getX() - pts[j].getX(), pts[i].getY() - pts[j].getY());
				Point2D r = rot.transform(v, null);
				dist[i][j] = dist[j][i] = Math.abs(r.getX()) + Math.abs(r.getY());
			}
		}
		
		// Dp state: places to visit, current place
		double[][] dp = new double[1<<n][n];
		for(int i = 1; i < (1<<n); i++) {
			for(int j = 0; j < n; j++) {
				dp[i][j] = Double.MAX_VALUE / 3;
				for(int k = 0; k < n; k++) {
					if((i & (1<<k)) == 0) continue;
					if(j == k) continue;
					dp[i][j] = Math.min(dp[i][j], dp[i^(1<<k)][k] + dist[j][k]);
				}
			}
		}
		double best = Double.MAX_VALUE / 3;
		for(int i = 0; i < n; i++)
			best = Math.min(best, dp[(1<<n)-(1<<i)-1][i]);
		return best;
	}
}