#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <algorithm>

#include <cmath>

#define LL long long int

#define lson l, m, rt << 1

#define rson m + 1, r, rt << 1 | 1

#define lc rt << 1

#define rc rt << 1 | 1

using namespace std;

const int MAXN = ;

LL sum[MAXN << ];

bool one[MAXN << ];

void PushUp( int rt )

{

    sum[rt] = sum[lc] + sum[rc];

    one[rt] = one[lc] && one[rc];

    return;

}

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

{

    if ( l == r )

    {

        scanf( "%I64d", &sum[rt] );

        if ( sum[rt] <=  ) one[rt] = true;

        else one[rt] = false;

        return;

    }

    int m = ( l + r ) >> ;

    build(lson);

    build(rson);

    PushUp( rt );

    return;

}

void Update( int L, int R, int l, int r, int rt )

{

    if ( one[rt] ) return;

    if ( l == r )

    {

        sum[rt] = (LL)sqrt( (double)sum[rt] );

        //之前这里忘了更新one，一直TLE
　　　　　if ( sum[rt] <=  ) one[rt] = true;

        else one[rt] = false;

        return;

    }

    int m = ( l + r ) >> ;

    if ( L <= m ) Update( L, R, lson );

    if ( R > m )  Update( L, R, rson );

    PushUp( rt );

    return;

}

LL Query( int L, int R, int l, int r, int rt )

{
　　 //这句不要，之前想错了
　　 //if ( one[rt] ) return (LL)r - l + 1;

    if ( L <= l && r <= R ) return sum[rt];

    int m = ( l + r ) >> ;

    LL res = ;

    if ( L <= m ) res += Query( L, R, lson );

    if ( R > m )  res += Query( L, R, rson );

    return res;

}

int N;

int main()

{

    int cas = ;

    while ( scanf( "%d", &N ) ==  )

    {

        build( , N,  );

        int Q;

        scanf( "%d", &Q );

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

        while ( Q-- )

        {

            int op, a, b;

            scanf( "%d%d%d", &op, &a, &b );

            if ( b < a ) swap(a, b);

            if ( op )

            {

                printf("%I64d\n", Query( a, b, , N,  ) );

            }

            else

            {

                Update( a, b, , N,  );

            }

        }

        puts("");

    }

    return ;

}