#include<iostream>

#include<cstdio>

#include <cctype>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<string>

#include<cmath>

#include<set>

#include<vector>

#include<stack>

#include<queue>

#include<map>

using namespace std;

#define ll long long

#define mem(a,x) memset(a,x,sizeof(a))

#define se second

#define fi first

const ll mod=1e9+;

const int INF= 0x3f3f3f3f;

const int N=1e5+;

ll add[N<<],sum[N<<];

ll a[N<<];

int vis[N<<];

/*

struct node

{

    int v,p;

}b[N<<2];

bool cmp(node x,node y)

{

    return x.v<y.v;

}*/

void push_up(int rt)

{

    sum[rt] = sum[rt<<] + sum[rt<<|] ;

    vis[rt] = vis[rt<<] & vis[rt<<|] ; //左右子节点的vis都是1 父节点才是1

}

/*

void push_down(int rt,int ln ,int rn)

{

    if(add[rt])

    {

        add[rt<<1]=add[rt<<1|1]=add[rt];

        sum[rt<<1]=add[rt]*ln;

        sum[rt<<1|1]=add[rt]*rn;

        add[rt]=0;

    }

}*/

void Built(int l,int r,int rt)

{

    if(l==r)

    {

        sum[rt]=a[l];

        if(sum[rt]<=) vis[rt]=;

        return;

    }

    int m=l+r>>;

    Built(l,m,rt<<);

    Built(m+,r,rt<<|);

    push_up(rt);

}

void update(int x,int y,int l,int r,int rt)

{

    if(l==r)

    {

        sum[rt]= 1LL*sqrt(sum[rt]*1.0);

        if( sum[rt]<= ) vis[rt]=;

        return;

    }

    int m=l+r>>;

    //push_down(rt,m-l+1,r-m);

    if(x<=m && !vis[rt<<]) update(x,y,l,m,rt<<);

    if(m<y && !vis[rt<<|]) update(x,y,m+,r,rt<<|);

    push_up(rt);

}

ll Query(int x,int y, int l,int r,int rt)

{

    if(x<=l && r<=y)

    {

        return sum[rt];

    }

    int m=l+r>>;

    //push_down(rt,m-l+1,r-m);

    ll ans=;

    if(x<=m) ans+=Query(x,y,l,m,rt<<);

    if(m<y) ans+=Query(x,y,m+,r,rt<<|);

    return ans;

}

int main()

{

    int x,y,c=,n,m,q;

       while(~scanf("%d",&n) )

       {

           /*for(int i=1;i<=n;i++) scanf("%d",&b[i].v),b[i].p=i;

           sort(b+1,b+1+n,cmp);

        int cnt=0;

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

        {

            if(b[i].v != b[i-1].v)

                cnt++;

               a[b[i].p]=cnt;

           }//离散化完毕  */

           for(int i=;i<=n;i++)  scanf("%lld",&a[i]);

        mem(vis,);

        mem(sum,);

           Built(,n,);

           scanf("%d",&m);

           printf("Case #%d:\n",++c);

        while(m--)

        {

            scanf("%d%d%d",&q,&x,&y);

            if(x>y) swap(x,y);

            if(q==)

                update(x,y,,n,);

            else

                printf("%lld\n",Query(x,y,,n,) );

        }

        cout<<endl;

    }

}