#include <bits/stdc++.h>

#define x first
#define y second

const int MAX_N = 100005;
const long long INF = 4e18;

int n;

std::pair <long long, long long> arr[MAX_N];

long long square(long long value) {
  return value * value;
}

long long distance(std::pair <long long, long long> a,
                  std::pair <long long, long long> b) {
  return (square(a.x - b.x) + square(a.y - b.y));
}

long long dei(int lo, int ri) {
  std::vector <std::pair <long long, long long>> points;
  long long min = INF, lo_ans, ri_ans;
  long long len = ri - lo, mid = (lo + ri) >> 1;
  if (len <= 3) {
    for (int i = lo; i <= ri; ++i) {
      points.push_back(arr[i]);
    }
    for (int i = 0; i < points.size(); ++i) {
      for (int j = i + 1; j < points.size(); ++j) {
        min = std::min(min, distance(points[i], points[j]));
      }
    }
    return min;
  }
  lo_ans = dei(lo, mid);
  ri_ans = dei(mid + 1, ri);
  min = std::min(lo_ans, ri_ans);
  for (int i = lo; i <= ri; ++i) {
    if (abs(arr[mid].x - arr[i].x) <= min) {
      points.push_back(arr[i]);
    }
  }
  for (int i = 0; i < points.size(); ++i) {
    for (int j = i + 1; j < points.size(); ++j) {
      min = std::min(min, distance(arr[i], arr[j]));
    }
  }
  return min;
}

int main() {
  freopen("cmap.in", "r", stdin);
  freopen("cmap.out", "w", stdout);
  std::cin >> n;
  for (int i = 1; i <= n; ++i) {
    std::cin >> arr[i].x >> arr[i].y;
  }
  std::sort(arr + 1, arr + n + 1);
  std::cout << std::fixed << std::setprecision(6) << sqrt(1.0 * dei(1, n));
  return 0;
}