#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
mt19937 rnd(time(0));
const int MAXN=1e5+5,V=1e6+1;
const ld eps=1e-6;
int n,m;ld ans[MAXN],S;
ld dis(ll x,ll y){return sqrt(x*x+y*y);}
struct chgl{int x,y,id,o;};
struct qry{int x,y,id,o;};
struct DS{
ld A[V+5],di[MAXN];int n,q,rt;
int ls[MAXN],rs[MAXN],rd[MAXN];
ld myk[MAXN],myb[MAXN],k[MAXN],b[MAXN],xk[MAXN],xb[MAXN];
chgl c[MAXN*2];qry d[MAXN*4];
void add(int x,ld y){while(x<=V)A[x]+=y,x+=(x&-x);}
ld ask(int x){ld r=0;while(x)r+=A[x],x-=(x&-x);return r;}
void newseg(int x1,int y1,int x2,int y2){
	++n;di[n]=dis(x1-x2,y1-y2);// 对 y 扫描线
	c[2*n-1]={x1,y1,n,1};c[2*n]={x2,y2,n,-1};rd[n]=rnd();
	b[n]=myb[n]=-di[n]*y1/(y2-y1);k[n]=myk[n]=di[n]/(y2-y1);
	xk[n]=1.*(x2-x1)/(y2-y1);xb[n]=x1-xk[n]*y1;
}
void newqry(int x1,int y1,int x2,int y2){
	++q;
	d[4*q-3]={x1,y1,q,1};d[4*q-2]={x1,y2,q,-1};
	d[4*q-1]={x2,y1,q,-1};d[4*q]={x2,y2,q,1};
}
void pushup(int id){
	k[id]=myk[id]+k[ls[id]]+k[rs[id]];
	b[id]=myb[id]+b[ls[id]]+b[rs[id]];
}
void split(int id,int y,ld x,int &p,int &q){
	if(!id){p=q=0;return;}
	if(xk[id]*y+xb[id]<=x){p=id;split(rs[id],y,x,rs[id],q);pushup(id);return;}
	else{q=id;split(ls[id],y,x,p,ls[id]);pushup(id);return;}
}
int merge(int p,int q){
	if(!p||!q) return p|q;
	if(rd[p]>rd[q]){rs[p]=merge(rs[p],q),pushup(p);return p;}
	else{ls[q]=merge(p,ls[q]);pushup(q);return q;}
}
void solve(int o){
	if(n==0) return;
	sort(c+1,c+2*n+1,[&](chgl x,chgl y){return x.y<y.y;});
	sort(d+1,d+4*q+1,[&](qry x,qry y){return x.y<y.y;});
	for(int i=1,j=1;i<=4*q;i++){
		while(j<=2*n&&c[j].y<=d[i].y){
			int x=c[j].x,k=c[j].id;
			int p,q,r;split(rt,c[j].y,x-eps,p,q);
			if(c[j].o==1){
				// newseg
				rt=merge(p,merge(k,q));
			}else{
				split(q,c[j].y,x+eps,q,r);
				rt=merge(p,r);
				if(o) add(x,di[k]);
			}
			j++;
		}
		int t=d[i].id;
		int p,q;
		split(rt,d[i].y,d[i].x+(o?eps:-eps),p,q);
		ans[t]+=d[i].o*(k[p]*d[i].y+b[p]);
		rt=merge(p,q);
		if(o) ans[t]+=d[i].o*ask(d[i].x);
	}
}
}A1,A2,B1,B2;
int main(){
	// freopen("Otomachi_Una.in","r",stdin);
	// freopen("Otomachi_Una.out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;S+=dis(x1-x2,y1-y2);
		if(x1>x2) swap(x1,x2),swap(y1,y2);
		if(y1<y2) A1.newseg(x1,y1,x2,y2),A2.newseg(y1,x1,y2,x2);
		else y1=V-y1,y2=V-y2,B1.newseg(x1,y1,x2,y2),B2.newseg(y1,x1,y2,x2);
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		A1.newqry(x1,y1,x2,y2);A2.newqry(y1,x1,y2,x2);
		y1=V-y1,y2=V-y2,swap(y1,y2);
		B1.newqry(x1,y1,x2,y2),B2.newqry(y1,x1,y2,x2);
	}
	A1.solve(0);A2.solve(1);B1.solve(0);B2.solve(1);
	for(int i=1;i<=m;i++) cout<<setprecision(12)<<ans[i]/S<<'\n';
	return 0;
}