#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 400005;
const ll INF = 0x7FFFFFFFFFFFFFFF;

int n;
struct Point { ll x, y; } pt[N];
bool operator < (Point l, Point r) { return l.x < r.x; }

ll divide(int l, int r) { // sort by Y
    if (l == r) return INF;
    int mid((l + r) >> 1);
    ll midx = pt[mid].x;
    ll d = min(divide(l, mid), divide(mid + 1, r));
    static Point tmp[N];
    int p = l, q = mid + 1, k = l;
    for (; p <= mid && q <= r; ++k) {
        if (pt[p].y <= pt[q].y) tmp[k] = pt[p], ++p;
        else tmp[k] = pt[q], ++q;
    }
    for (; p <= mid; ++p, ++k) tmp[k] = pt[p];
    for (; q <= r; ++q, ++k) tmp[k] = pt[q];

    for (int i = l; i <= r; ++i) pt[i] = tmp[i];
    p = q = l;
    for (int i = l; i <= r; ++i) {
        while (q < r && (pt[q + 1].y - pt[i].y) * (pt[q + 1].y - pt[i].y) <= d) ++q;
        while (p < q && (pt[i].y - pt[p].y) * (pt[i].y - pt[p].y) > d) ++p;
        if ((pt[i].x - midx) * (pt[i].x - midx) > d) continue;
        for (int j = p; j <= q; ++j) if (j != i) {
            d = min(d, (pt[j].x - pt[i].x) * (pt[j].x - pt[i].x) + (pt[j].y - pt[i].y) * (pt[j].y - pt[i].y));
        }
    }
    return d;
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%lld%lld", &pt[i].x, &pt[i].y);
    sort(pt + 1, pt + n + 1);
    printf("%.8lf", sqrtl(divide(1, n)));
    return 0;
}