#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  vector < pair < int, int > > p(n);
  for (auto &[x, y] : p) cin >> x >> y;
  sort(p.begin(), p.end());
  auto sol = [&](auto &self, int l, int r) -> long double {
    if (l == r) return numeric_limits < long double > :: max();
    int m = (l + r) >> 1;
    auto d = min(self(self, l, m), self(self, m + 1, r));
    vector < pair < int, int > > q;
    auto dist = [](const auto &lhs, const auto &rhs) -> long double {
      return sqrtl(pow(lhs.first - rhs.first, 2) + pow(lhs.second - rhs.second, 2));
    };
    for (int i = l; i <= r; i++) {
      if (dist(p[i], p[m]) < d) q.push_back(p[i]);
    }
    sort(q.begin(), q.end(), [](const auto &lhs, const auto &rhs) -> bool { return lhs.second < rhs.second; });
    for (size_t i = 0; i < q.size(); i++) {
      for (size_t j = i + 1; j < q.size() && abs(q[i].second - q[j].second) < d; j++) {
        d = min(d, dist(q[i], q[j]));
      }
    }
    return d;
  };
  cout << fixed << setprecision(31) << sol(sol, 0, n - 1);
  return 0;
}