import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

class Main {
    
    private static double dist(Punct p1, Punct p2) {
    
        return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
    }
    
    private static double divide(int st, int dr, Punct[] array) {
    
        if (dr - st <= 2) {
            return Math.min(Math.min(dist(array[st], array[st + 1]), dist(array[st], array[st + 2])), dist(array[st + 1], array[st + 2]));
        } else {
            int m = (st + dr) / 2;
            double d1 = Math.min(divide(st, m, array), divide(m + 1, dr, array));
            double d2 = d1;
            for (int i = m; i >= st && array[m].x - array[i].x <= d1; i--)
                for (int j = 1; j <= 7 && i + j <= dr; j++)
                    d2 = Math.min(d2, dist(array[i], array[i + j]));
            return d2;
        }
    }
    
    public static void main(String args[]) throws FileNotFoundException {
    
        int nrPuncte;
        Punct[] array = null;
        Scanner scanner = new Scanner(new FileReader("cmap.in"));
        nrPuncte = scanner.nextInt();
        array = new Punct[nrPuncte];
        
        for (int index = 0; index < nrPuncte; index++) {
            
            double x = scanner.nextDouble();
            double y = scanner.nextDouble();
            array[index] = new Punct(x, y);
        }
        Arrays.sort(array);
        PrintWriter g = new PrintWriter("cmap.out");
        g.printf("%.6f\n", Math.sqrt(divide(0, nrPuncte - 1, array)));
        g.close();
        scanner.close();
    }
}

class Punct implements Comparable<Punct> {
    double x, y;
    
    public Punct() {
    
        x = 0;
        y = 0;
    }
    
    public Punct(double x, double y) {
    
        this.x = x;
        this.y = y;
    }
    
    @Override
    public int compareTo(Punct a) {
    
        if (y < a.y)
            return -1;
        return 1;
    }
}