#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
vector<int> vt;
int n;
cin >> n;
double a[n + 1];
double b[n + 1];
for(int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
map<pair<int, int>, double> mp;
for(int i = 1; i <= n; i++) {
for(int j = i + 1; j <= n; j++) {
if(mp.find({a[i], b[i]}) != mp.end()) {
mp[{a[i], b[i]}] = min(mp[{a[i], b[i]}], sqrt((abs(a[i] - a[j]) / 2) * (abs(a[i] - a[j]) / 2) + (abs(b[i] - b[j]) / 2) * (abs(b[j] - b[i]) / 2)));
//mp[{a[j], b[j]}] = min(mp[{a[i], b[i]}], sqrt((abs(a[i] - a[j]) / 2) * (abs(a[i] - a[j]) / 2) + (abs(b[i] - b[j]) / 2) * (abs(b[j] - b[i]) / 2)));
}
else {
mp[{a[i], b[i]}] = sqrt((abs(a[i] - a[j]) / 2) * (abs(a[i] - a[j]) / 2) + (abs(b[i] - b[j]) / 2) * (abs(b[j] - b[i]) / 2));
//mp[{a[j], b[j]}] = sqrt((abs(a[i] - a[j]) / 2) * (abs(a[i] - a[j]) / 2) + (abs(b[i] - b[j]) / 2) * (abs(b[j] - b[i]) / 2));
}
}
}
double ans = 0;
for(int i = 1; i < n; i++) {
ans = max(ans, mp[{a[i], b[i]}]);
}
cout << setprecision(7) << fixed << ans << endl;
}
signed main(){
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
