#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX_N = 4e5 + 10;
const double INF = 1e20;
int n;
double ans = INF;
pii p[MAX_N];
inline bool cmpx(pii x, pii y) {return x.first < y.first;}
inline bool cmpy(pii x, pii y) {return x.second < y.second;}

inline ll read() {
    ll ret = 0, w = 1; char c = getchar();
    while(!isdigit(c))    {if(c == '-')    w = -1; c = getchar();}
    while(isdigit(c))    {ret = (ret << 1) + (ret << 3) + (c ^ 48); c = getchar();}
    return ret * w;
}

double dis(pii x, pii y) {
    double dx = 1.0 * x.first - y.first, dy = 1.0 * x.second - y.second;
    return sqrt(dx * dx + dy * dy);
}
void solve(int l, int r) {
    if(l + 1 >= r)  return;
    int mid = (l + r) >> 1, midx = p[mid].first;
    solve(l, mid), solve(mid, r);
    inplace_merge(p + l, p + mid, p + r, cmpy);
    vector<int> t;
    for(int i = l; i < r; i++)
        if((double)abs((double)midx - p[i].first) <= ans)    t.push_back(i);
    int i = 0, j = 0;
    for(; i < (int)t.size(); i++) {
        while(j < (int)t.size() && (double)p[t[j]].second <= (double)p[t[i]].second + ans)
            j++;
        for(int k = i + 1; k < j; k++)
            ans = min(ans, dis(p[t[i]], p[t[k]]));
    }
}

int main() {
    n = read();
    for(int i = 0; i < n; i++)
        p[i].first = read(), p[i].second = read();
    sort(p, p + n, cmpx);
    solve(0, n);
    cout << ans << endl;
    return 0;
}