#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

#define mp make_pair
#define pb push_back
#define PIII pair<int, pair<int, int> >
#define f first
#define s second

int N, X, Y;
long long ans = 1LL << 62;
vector<PIII> V;

long long dist(PIII one, PIII two)
{
    return 1LL * (one.s.f - two.s.f) * (one.s.f - two.s.f) + 1LL * (one.s.s - two.s.s) * (one.s.s - two.s.s);
}

int main()
{
    freopen("cmap.in", "r", stdin);
    freopen("cmap.out", "w", stdout);
    scanf("%i", &N);
    for(int i = 0; i < N; i++)
    {
        scanf("%i %i", &X, &Y);
        V.pb(mp(X + Y, mp(X, Y)));
    }
    sort(V.begin(), V.end());
    for(int i = 0; i < N; i++)
        for(int j = i + 1; j <= min(i + 7, N - 1); j++)
            ans = min(ans, dist(V[i], V[j]));
    printf("%lf\n", sqrt(ans));
    return 0;
}