#include<bits/stdc++.h>
using namespace std;
const double eps = 1e-12;
const double INF = 1e18;
const double PI = acos(-1.0);
double ACOS(double x)
{
    if(x>1)
        x=1.0;
    if(x<-1)
        x=-1.0;
    return acos(x);
}
double SQRT(double x)
{
    if(x<0)
        return 0;
    return sqrt(x);
}

struct Point3D
{
    double x, y, z;
    Point3D() {};
    Point3D(double xx, double yy,double zz)
    {
        x = xx;
        y = yy;
        z = zz;
    }
};
typedef struct Point2D
{
    Point2D() {};
    double x;
    double y;
    Point2D(double xx, double yy)
    {
        x = xx;
        y = yy;
    }
} Point;

struct Circle3D
{
    Point3D o;
    double r;
};
struct Circle
{
    Point2D o;
    double r;
};


struct Line
{
    Point s, e;
    Line() {};
    Line(Point a, Point b)
    {
        s = a;
        e = b;
    };
};


double dis(Point a, Point b)
{
    return SQRT(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}


double dis(Point3D a, Point3D b)
{
    return SQRT(pow(a.x - b.x, 2) + pow(a.y - b.y, 2) + pow(a.z - b.z, 2));
}

double solve(Point3D s, Point3D t, Circle3D o)
{
    double so=dis(s,o.o);
    double to=dis(t,o.o);
    double st=dis(s,t);
    double sita_sot=ACOS((so*so+to*to-st*st)/2/so/to);
    double sita_sto=ACOS((st*st+to*to-so*so)/2/st/to);
    double sita_tso=ACOS((st*st+so*so-to*to)/2/st/so);


    double p=(so+to+st)/2;
    double d=SQRT(p*(p-so)*(p-to)*(p-st))*2/st;


    if(sita_sto<PI/2&&sita_tso<PI/2&&d<o.r)
    {
        double sita_soa1=ACOS(o.r/so);
        double sita_toa2=ACOS(o.r/to);

        double sita=sita_sot-sita_soa1-sita_toa2;

        return sita*o.r + so*sin(sita_soa1) + to*sin(sita_toa2);

    }
    else
    {
        return dis(s, t);
    }
}


double solve(Point s, Point t, Circle o)
{
    double so=dis(s,o.o);
    double to=dis(t,o.o);
    double st=dis(s,t);
    double sita_sot=ACOS((so*so+to*to-st*st)/2/so/to);
    double sita_sto=ACOS((st*st+to*to-so*so)/2/st/to);
    double sita_tso=ACOS((st*st+so*so-to*to)/2/st/so);


    double p=(so+to+st)/2;
    double d=SQRT(p*(p-so)*(p-to)*(p-st))*2/st;


    if(sita_sto<PI/2&&sita_tso<PI/2&&d<o.r)
    {
        double sita_soa1=ACOS(o.r/so);
        double sita_toa2=ACOS(o.r/to);

        double sita=sita_sot-sita_soa1-sita_toa2;

        return sita*o.r + so*sin(sita_soa1) + to*sin(sita_toa2);

    }
    else
    {
        return dis(s, t);
    }
}
double solve(double a,double b,double c,double r)
{
    Point s, t;
    Circle o;
    double arcsita = (pow(b, 2) + pow(c, 2) - pow(a, 2)) / 2 / b / c;
    double sita = ACOS(arcsita);

    t.x = c * cos(sita);
    t.y = c * sin(sita);

    o.o.x = 0;
    o.o.y = 0;
    o.r = r;

    s.x = b;
    s.y = 0;

    return solve(s, t, o);
}


int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        Circle3D o;
        Point3D s, t;
        scanf("%lf%lf%lf%lf", &o.o.x, &o.o.y, &o.o.z,&o.r);
        scanf("%lf%lf%lf", &s.x, &s.y, &s.z);
        scanf("%lf%lf%lf", &t.x, &t.y, &t.z);
        double a = dis(s, t);
        double b = dis(s, o.o);
        double c = dis(t, o.o);

        if(fabs(a)<eps)
        {
            printf("0.0000000000\n");
        }
        else
        {
            printf("%.8lf\n", solve(a,b,c,o.r));
        }
    }
}

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ls (u<<1)
#define rs (u<<1|1)
#define ml ((l+r)>>1)
#define mr (ml+1)
struct segment_tree{
    const static ll maxn=2.1e4;
    const static ll MOD=1e9+7;
    static ll pow_2[maxn];
    ll n;
    ll tree[maxn<<2];

    static void pow_ini(){
        pow_2[0]=1;
        for(int i=1;i<maxn;i++){
            pow_2[i]=pow_2[i-1]*2;
            if(pow_2[i]>MOD)pow_2[i]-=MOD;
        }
    }


    void pushup(ll l ,ll r,ll u){
        tree[u]=(tree[ls]*pow_2[r-((l+r)>>1)]+tree[rs])%MOD;
    }
    void build(ll nn){
        n=nn;
        build(1,n,1);
    }


    void build(ll l,ll r,ll u){
        if(l==r){
            tree[u]=0;
            return ;
        }

        build(l,ml,ls);
        build(mr,r,rs);
        pushup(l,r,u);
    }
    void update(ll q,ll d){
        update(q,d,1,1,n);
    }
    void update(ll q,ll d,ll u,ll l,ll r){
        if(q<=l&&r<=q){
            tree[u]=(tree[u]+d*pow_2[r-q])%MOD;
            return ;
        }
        if(q<=ml)update(q,d,ls,l,ml);
        if(q>=mr)update(q,d,rs,mr,r);
        pushup(l,r,u);
    }
    ll query(ll ql,ll qr){
        return query(ql,qr,1,1,n)%MOD;
    }
    ll query(ll ql,ll qr,ll u,ll l,ll r){
        if(ql<=l&&r<=qr)return tree[u]*pow_2[qr-r]%MOD;
        ll ret=0;
        if(ql<=ml)ret=ret+query(ql,qr,ls,l,ml);
        if(qr>=mr)ret=ret+query(ql,qr,rs,mr,r);
        return ret;
    }
}t1,t2;

ll segment_tree::pow_2[maxn];

const int maxn=segment_tree::maxn;
int per[maxn];


int main(){

    segment_tree::pow_ini();

    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)scanf("%d",per+i);

        t1.build(n);
        t2.build(n);

        string ans="N";
        for(int mid=1;mid<n-1;mid++){
            t1.update(per[mid-1],1);
            t2.update(n+1-per[mid-1],1);

            int len=min(per[mid]-1,n-per[mid]);
            if(len==0)continue;

            if(t1.query(per[mid]-len,per[mid]-1)!=t2.query(      n+1-(per[mid]+len)   ,   n+1-(per[mid]+1) )){
                ans="Y";
                break;
            }
        }
        cout<<ans<<endl;
    }
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long

const ll maxn=1e5+5;
map<ll,ll>mp;
ll t,n,q;
ll a[maxn];

ll mm[maxn],rmq[maxn][20];

void st(ll l,ll r){
    mm[0]=-1;
    for(ll i=1;i<maxn;i++){
        mm[i]=((i&i-1)==0)?mm[i-1]+1:mm[i-1];
    }//如果卡常，可以放外面
    for(ll i=l;i<=r;i++)rmq[i][0]=a[i];
    for(ll j=1;j<=mm[r-l+1];j++)
        for(ll i=l;i+(1<<j)-1<=r;i++)
            rmq[i][j]=__gcd(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
ll query(ll l,ll r){
    ll k=mm[r-l+1];
    return __gcd(rmq[l][k],rmq[r-(1<<k)+1][k]);
}


void ini()
{
    for(ll i=1; i<=n; i++)
    {
        ll l,r=i-1;

       // cout<<i<<":";
       ///100
        while(r<n){//  r : gcd[i..r]!=gcd[i,r+1]
           // cout<<r<<" ";
            ll pre_r=r;
            l=r+2,r=n+1;
            ll gcd=query(i,l-1);
            ///lg
            while(l<r){
                ll mid=(l+r)>>1;
                ///lg
                if(mid>n||gcd!=query(i,mid)){
                    r=mid;// query(i,r)!=gcd
                }
                else l=mid+1;//query(i,l-1)=gcd
            }// query(i,l-1)=gcd&&query(i,l)!=gcd
            mp[gcd]+=(l-1)-(pre_r+1)+1;
            r=l-1;
        }
      //  cout<<endl;
    }

}


int main()
{
    scanf("%lld",&t);
    for(ll time=1; time<=t; time++)
    {
        mp.clear();
        scanf("%lld",&n);
        for(ll i=1;i<=n;i++)scanf("%lld",a+i);

        st(1,n);
        ini();


        scanf("%lld",&q);
        printf("Case #%lld:\n",time);
        for(ll i=1; i<=q; i++)
        {
            ll l,r;
            scanf("%lld %lld",&l,&r);
            ll ans=query(l,r);
            printf("%lld ",ans);
            printf("%lld\n",mp[ans]);
        }
    }
}