#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <cstring>

#include <string>

#include <iostream>

#include <algorithm>

#define inf 0x3f3f3f3f

#define inf64 0x3f3f3f3f3f3f3f3f

using namespace std;

const int maxn = 1e5 + ;

typedef long long ll;

struct node

{

    ll len, sum;

}tree[maxn*];

ll a[maxn];

void push_up(int id)

{

    tree[id].sum = tree[id << ].sum + tree[id <<  | ].sum;

}

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

{

    tree[id].len = r - l + ;

    if(l==r)

    {

        tree[id].sum = a[l];

        return;

    }

    int mid = (l + r) >> ;

    build(id << , l, mid);

    build(id <<  | , mid + , r);

    push_up(id);

}

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

{

    if (x <= l && y >= r && tree[id].len == tree[id].sum) return;

    if(l==r)

    {

        tree[id].sum = sqrt(tree[id].sum);

        return;

    }

    int mid = (l + r) >> ;

    if (x <= mid) update(id << , l, mid, x, y);

    if (y > mid) update(id <<  | , mid + , r, x, y);

    push_up(id);

}

ll query(int id,int l,int r,int x,int y)

{

    if(x<=l&&y>=r) return tree[id].sum;

    int mid = (l + r) >> ;

    ll ans = ;

    if (x <= mid) ans += query(id << , l, mid, x, y);

    if (y > mid) ans += query(id <<  | , mid + , r, x, y);

    return ans;

}

int main()

{

    int n, m, cas = ;

    while(scanf("%d", &n)!=EOF)

    {

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

        build(, , n);

        scanf("%d", &m);

        cout << "Case #" << cas++ << ":" << endl;

        while(m--)

        {

            int opt, x, y;

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

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

            if(opt==) update(, , n, x, y);

            else

            {

                ll ans = query(, , n, x, y);

                printf("%lld\n", ans);

            }

        }

        printf("\n");

    }

    return ;

}