#include<cmath>

#include<cstdio>

#include<algorithm>

#define eps 1e-12

#define MN 100001

#define ll long long

#define ld double

using namespace std;

int read_p,read_ca;

inline int read(){

    read_p=;read_ca=getchar();

    while(read_ca<''||read_ca>'') read_ca=getchar();

    while(read_ca>=''&&read_ca<='') read_p=read_p*+read_ca-,read_ca=getchar();

    return read_p;

}

struct po{int x,y;};

struct na{po p;int n;}p[MN];

struct e{int x,y,ne,pre;}b[MN<<];

struct _e{int y,ne;ll z;}_b[MN];

struct bi{int x,y;ll z;}B[MN<<];

bool operator < (bi a,bi b){return a.z<b.z;}

bool operator < (na a,na b){return a.p.x==b.p.x?a.p.y<b.p.y:a.p.x<b.p.x;}

int n,m,num=,l[MN],st[MN],top,ct[MN],NUM=,x,y,_l[MN],_num=,fa[MN],f[MN][],de[MN];

ll v[MN][];

inline void in(int x,int y,ll z){_b[++_num].y=y;_b[_num].z=z;_b[_num].ne=_l[x];_l[x]=_num;}

inline void _add(int x,int y){b[++num].x=x;b[num].y=y;b[num].ne=l[x];b[l[x]].pre=num;l[x]=num;}

inline void add(int x,int y){_add(x,y);_add(y,x);}

inline void _del(int i){if(l[b[i].x]==i)l[b[i].x]=b[i].ne;else{b[b[i].pre].ne=b[i].ne;if(b[i].ne)b[b[i].ne].pre=b[i].pre;}}

inline void del(int i){_del(i);_del(i^);}

inline int max(int a,int b){return a>b?a:b;}

ll cha(po a,po b,po c){return 1LL*(b.x-a.x)*(c.y-b.y)-1LL*(c.x-b.x)*(b.y-a.y);}

bool _cha(po a,po b,po c){return cha(a,b,c)<=;}

inline bool ju(po a,po b,po c,po d){return (_cha(a,b,c)^_cha(a,b,d))&&(_cha(c,d,a)^_cha(c,d,b));}

ll sqr(int &x){return 1LL*x*x;}

ld sqr(ld x){return x*x;}

bool incir(po a,po b,po c,po d){

    ll m=(1LL*a.x*(b.y-c.y)+1LL*b.x*(c.y-a.y)+1LL*c.x*(a.y-b.y))<<;

    ld x=(ld)(sqr(a.x)*(b.y-c.y)+sqr(b.x)*(c.y-a.y)+sqr(c.x)*(a.y-b.y)-1LL*(a.y-b.y)*(b.y-c.y)*(c.y-a.y))/m;

    ld y=(ld)(1LL*(a.x-b.x)*(b.x-c.x)*(c.x-a.x)-sqr(a.y)*(b.x-c.x)-sqr(b.y)*(c.x-a.x)-sqr(c.y)*(a.x-b.x))/m;

    return sqrt(sqr(x-a.x)+sqr(y-a.y))+eps>sqrt(sqr(x-d.x)+sqr(y-d.y));

}

void work(int L,int R){

    if (R-L<=){

        for (int i=L;i<=R;i++) ct[p[i].n]=i;

        for (int i=L;i<R;i++)

        for (int j=i+;j<=R;j++) add(i,j);

        return;

    }

    int mid=L+R>>;

    work(L,mid);work(mid+,R);

    top=;

    for (int i=L;i<=R;st[++top]=i++)

    while (top>&&cha(p[st[top-]].p,p[st[top]].p,p[i].p)<) top--;

    int Ld,Rd,id;

    for (int i=;i<top;i++)

    if (st[i]<=mid&&st[i+]>mid) Ld=st[i],Rd=st[i+];

    add(Ld,Rd);

    for(;;){

        id=-;

        for (int i=l[Ld];i;i=b[i].ne)

        if (b[i].y!=Rd)

        if (cha(p[b[i].y].p,p[Ld].p,p[Rd].p)>&&(id==-||incir(p[Ld].p,p[Rd].p,p[id].p,p[b[i].y].p))) id=b[i].y;

        for (int i=l[Rd];i;i=b[i].ne)

        if (b[i].y!=Ld)

        if (cha(p[Ld].p,p[Rd].p,p[b[i].y].p)>&&(id==-||incir(p[Ld].p,p[Rd].p,p[id].p,p[b[i].y].p))) id=b[i].y;

        if (id==-) break;

        if (id<=mid){

            for (int i=l[Ld];i;i=b[i].ne)

            if (b[i].y!=Rd)

            if (ju(p[id].p,p[Rd].p,p[b[i].y].p,p[Ld].p)) del(i);

            Ld=id;

        }else{

            for (int i=l[Rd];i;i=b[i].ne)

            if (b[i].y!=Ld)

            if (ju(p[id].p,p[Ld].p,p[b[i].y].p,p[Rd].p)) del(i);

            Rd=id;

        }

        add(Ld,Rd);

    }

}

int gf(int x){return fa[x]==x?x:fa[x]=gf(fa[x]);}

void dfs(int x,int _f){

    for (int i=;i<;i++) f[x][i]=f[f[x][i-]][i-],v[x][i]=max(v[x][i-],v[f[x][i-]][i-]);

    for (int i=_l[x];i;i=_b[i].ne)

    if (_b[i].y!=_f) de[_b[i].y]=de[x]+,f[_b[i].y][]=x,v[_b[i].y][]=_b[i].z,dfs(_b[i].y,x);

}

ll Mavis(int x,int y){

    ll mmh=;

    if (de[x]<de[y]) swap(x,y);

    for (int i=;i>=;i--)

    if (de[y]<=de[f[x][i]]){

        if (v[x][i]>mmh) mmh=v[x][i];

        x=f[x][i];

    }

    if (x==y) return mmh;

    for (int i=;i>=;i--)

    if (f[y][i]!=f[x][i]){

        if (v[x][i]>mmh) mmh=v[x][i];

        if (v[y][i]>mmh) mmh=v[y][i];

        x=f[x][i];y=f[y][i];

    }

    if (v[x][]>mmh) mmh=v[x][];

    if (v[y][]>mmh) mmh=v[y][];

    return mmh;

}

int main(){

    register int i,j;

    n=read();

    for (i=;i<n;i++) p[i].p.x=read(),p[i].p.y=read(),p[i].n=i+,fa[i]=i;

    sort(p,p+n);

    work(,n-);

    for (i=;i<n;i++)

    for (j=l[i];j;j=b[j].ne) if (b[j].y>i) B[NUM].x=i,B[NUM].y=b[j].y,B[NUM++].z=sqr(p[i].p.x-p[b[j].y].p.x)+sqr(p[i].p.y-p[b[j].y].p.y);

    sort(B,B+NUM);

    for (i=;i<NUM;i++){

        if (p[B[i].x].n>p[B[i].y].n) swap(B[i].x,B[i].y);

        int x=gf(B[i].x),y=gf(B[i].y);

        if (x==y) continue;

        fa[x]=y;

        in(B[i].x,B[i].y,B[i].z);in(B[i].y,B[i].x,B[i].z);

    }

    dfs(,);

    m=read();

    while (m--){

        x=ct[read()];y=ct[read()];

        printf("%.6lf\n",sqrt(Mavis(x,y)));

    }

}