#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000005
int n, m;
long long w[MAXN * 4], a[MAXN];
bool lzy[MAXN];
bool InRange(int L, int R, int l, int r)
{
    return (L >= l) && (R <= r);
}
bool OutofRange(int L, int R, int l, int r)
{
    return (L > r) || (R < l);
}
void pushup(int u)
{
    w[u] = w[u * 2] + w[u * 2 + 1];
}
void build(int u, int L, int R)
{
    if (L == R)
    {
        w[u] = a[L];
        return;
    }
    int M = (L + R) / 2;
    build(u * 2, L, M);
    build(u * 2 + 1, M + 1, R);
    pushup(u);
}
void update(int u, int L, int R, int l, int r)
{
    if (lzy[u] == 1)
    {
        return;
    }
    if (w[u] <= 1)
    {
        lzy[u] = 1;
        return;
    }
    if (InRange(L, R, l, r) && (L == R))
    {
        w[u] = sqrt(w[u]);
        return;
    }
    else if (!OutofRange(L, R, l, r))
    {
        int M = (L + R) / 2;
        if ((lzy[u * 2] == 1) && (lzy[u * 2 + 1] == 1))
        {
            lzy[u] = 1;
            return;
        }
        if (lzy[u * 2] == 0)
            update(u * 2, L, M, l, r);
        if (lzy[u * 2 + 1] == 0)
            update(u * 2 + 1, M + 1, R, l, r);
        pushup(u);
    }
}
long long query(int u, int L, int R, int l, int r)
{
    if (InRange(L, R, l, r))
    {
        return w[u];
    }
    else if (!OutofRange(L, R, l, r))
    {
        int M = (L + R) / 2;
        return query(u * 2, L, M, l, r) + query(u * 2 + 1, M + 1, R, l, r);
    }
    else
    {
        return 0;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0) , cout.tie(0);
    while (cin>>n && n!=EOF){
        if(n==EOF) break;
        memset(w, 0, sizeof(w));
        memset(lzy, 0, sizeof(lzy));
        memset(a, 0, sizeof(a));
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        build(1, 1, n);
        cin >> m;
        int op, x, y;
        for (int i = 1; i <= m; i++)
        {
            cin >> op >> x >> y;
            if (x > y)
            {
                swap(x, y);
            }
            if (op == 0)
            {
                update(1, 1, n, x, y);
            }
            else
            {
                cout << query(1, 1, n, x, y) << '\n';
            }
        }
        cout<<'\n';
    }
    return 0;
}