#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<double, double>> arr(n);
for(int i = 0; i < n; i++){
cin >> arr[i].first >> arr[i].second;
}
double ans = LLONG_MAX;
for(int i = 0; i < n; i++){
double change = 0;
for(int j = 0; j < n; j++){
if(i == j){
continue;
}
double current = sqrt(pow(arr[i].first - arr[j].first, 2) + pow(arr[i].second - arr[j].second, 2));
change = max(current, change);
}
ans = min(change, ans);
}
cout << ans / 2.0;
return 0;
}
