#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const db eps=1e-4;
const int N=4e2+10;
const int M=1e5+10;
const ll MOD=100007;
const int mod=1000000007;
const int MAX=1000000010;
const double pi=acos(-1.0);
struct twosat {
int n,k,d[N];
bool mark[N];
int tot,u[N],v[M],pre[M];
void init(int a) {
n=a<<1;tot=0;
for (int i=0;i<n;i++) u[i]=-1,mark[i]=false;
}
void add_Edge(int a,int aval,int b,int bval) {
a=a*2+aval;b=b*2+bval;
v[tot]=b;pre[tot]=u[a^1];u[a^1]=tot++;
v[tot]=a;pre[tot]=u[b^1];u[b^1]=tot++;
}
bool dfs(int a) {
if (mark[a]) return true;
if (mark[a^1]) return false;
mark[a]=true;d[k++]=a;
for (int i=u[a];~i;i=pre[i])
if (!dfs(v[i])) return false;
return true;
}
bool solve() {
int i,j;k=0;
for (i=0;i<n;i+=2)
if (!mark[i]&&!mark[i^1]) {
if (!dfs(i)) {
for (j=0;j<k;j++) mark[d[j]]=false;
k=0;if (!dfs(i^1)) return false;
}
}
return true;
}
}TS;
int n,a[N],b[N],c[N],d[N];
int dis(int x1,int y1,int x2,int y2,db z) {
return 1.0*(x1-x2)*(x1-x2)+1.0*(y1-y2)*(y1-y2)<=4.0*z*z;
}
bool pd(db x) {
int i,j;
TS.init(n);
for (i=0;i<n;i++)
for (j=i+1;j<n;j++) {
if (dis(a[i],b[i],a[j],b[j],x)) TS.add_Edge(i,1,j,1);
if (dis(a[i],b[i],c[j],d[j],x)) TS.add_Edge(i,1,j,0);
if (dis(c[i],d[i],a[j],b[j],x)) TS.add_Edge(i,0,j,1);
if (dis(c[i],d[i],c[j],d[j],x)) TS.add_Edge(i,0,j,0);
}
return TS.solve();
}
int main()
{
db l,r,mid;
while (~scanf("%d", &n)) {
for (int i=0;i<n;i++) scanf("%d%d%d%d", &a[i], &b[i], &c[i], &d[i]);
l=0;r=40000.0;mid=(l+r)/2.0;
while (fabs(r-l)>eps)
if (pd(mid)) l=mid,mid=(l+r)/2.0;
else r=mid,mid=(l+r)/2.0;
printf("%.2f\n", l);
}
return 0;
}