#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")

#include<bits/stdc++.h>

#define ll long long
#define inf 0x3f3f3f3f

using namespace std;
const double INF = 1e18;
const double eps = 1e-10;

struct node {
    double x, y;

    bool operator<(const node &a) const {
        return x < a.x;
    }
} s[200010], t[200010];

bool cmp(node a, node b) {
    return a.y < b.y;
}

double dis(node a, node b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

double cdq(int l, int r) {
    double d = INF;
    if (l >= r)return d;
    int mid = (l + r) >> 1;
    d = min(d, cdq(l, mid));
    d = min(d, cdq(mid + 1, r));
    int cnt = 0;
    for (int i = l; i <= r; i++) {
        if (fabs(s[i].x - s[mid].x) <= d)
            t[++cnt] = s[i];
    }
    sort(t + 1, t + 1 + cnt, cmp);
    for (int i = 1; i <= cnt; i++) {
        for (int j = i + 1; j <= cnt && fabs(t[i].y - t[j].y) <= d; j++) {
            if (dis(t[i], t[j]) < d)
                d = dis(t[i], t[j]);
        }
    }
    return d;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> s[i].x >> s[i].y;
    sort(s + 1, s + 1 + n);
    cout << fixed << setprecision(4) << (cdq(1, n)) << endl;
    return 0;
}