#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#define InFile  "cmap.in"
#define OutFile "cmap.out"
#define MAX 100001

using namespace std;

typedef long long i64;

const i64 INF = 4e18;

vector < pair <i64, i64> > V(MAX), X, Y;

i64 dist (const pair <i64,i64> & a, const pair <i64, i64> & b)
{
    return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}

i64 go (int st, int dr, vector < pair <i64, i64> > & X, vector < pair <i64, i64> > & Y)
{
    if (st >= dr - 1)
        return INF;
    else if (dr - st == 2)
    {
        if (Y[st] > Y[st+1])
            swap(Y[st], Y[st+1]);
        return dist(X[st], X[st + 1]);
    }
    int mid = (st + dr) / 2;
    i64 best = min(go(st, mid, X, Y), go(mid, dr, X, Y));

    merge(Y.begin() + st, Y.begin() + mid, Y.begin() + mid, Y.begin() + dr, V.begin());
    copy(V.begin(), V.begin() + (dr - st), Y.begin() + st);

    int v_size = 0;
    for (int i = st; i < dr; ++ i)
        if (abs(Y[i].second - X[mid].first) <= best)
            V[v_size ++] = Y[i];
    for (int i = 0; i < v_size - 1; ++ i)
    {
        for (int j = i + 1; j < v_size && j - i < 8; ++ j)
            best = min(best, dist(V[i], V[j]));
    }
    return best;
}

int main ()
{
    int n;
    ifstream fin(InFile);
    assert(fin >> n);
    assert(1 <= n && n <= 100000);
    X.resize(n), Y.resize(n);
    for (int i = 0; i < (int) X.size(); ++ i)
    {
        assert(fin >> X[i].first >> X[i].second);
        assert(-1000000000 <= X[i].first && X[i].first <= +1000000000);
        assert(-1000000000 <= X[i].second && X[i].second <= +1000000000);
    }
    sort(X.begin(), X.end());
    for (int i = 0; i < (int) X.size(); ++ i)
        Y[i] = make_pair(X[i].second, X[i].first);
    ofstream fout(OutFile);
    fout << fixed << setprecision(6) << sqrt(go(0, (int) X.size(), X, Y)) << "\n";
    return 0;
}