#include <iostream>

 #include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <vector>

 #include <utility>

 #include <iomanip>

 #include <string>

 #include <cmath>

 #include <queue>

 #include <map>

 const int MAXN =  + ;

 const int MAX =  + ;

 using namespace std;

 typedef long long ll;

 int n;

 ll C[MAXN];

 int data[MAXN], parent[MAXN];

 int SQRT(int x){return (int)floor(sqrt((double)x * 1.0));}

 int lowbit(int x){return x & -x;}

 void add(int x, int val){

      while (x <= n){

            C[x] += val;

            x += lowbit(x);

      }

      return;

 }

 ll sum(int x){

     ll cnt = ;

     while (x > ){

           cnt += C[x];

           x -= lowbit(x);

     }

     return cnt;

 }

 int find(int x) {return parent[x] == x? x : parent[x] = find(parent[x]);}

 void init(){

      memset(C, , sizeof(C));

      scanf("%d", &n);

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

          scanf("%d", &data[i]);

          add(i, data[i]);

          parent[i] = i;

          if (data[i] ==  || data[i] == ) parent[i] = i + ;

      }

      parent[n + ] = n + ;

 }

 void work(){

      int q;

      scanf("%d", &q);

      for (int i = ; i <= q; i++){

          int t, x, y;

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

          if (t == ) printf("%lld\n", sum(y) - sum(x - ));

          else{

               for (int i = x; i <= y; i = find(i + )){

                   int tmp = data[i];

                   data[i] = SQRT(data[i]);

                   add(i, data[i] - tmp);

                   if (data[i] <= ) parent[i] = find(i + );

               }

          }

      }

 }

 int main(){

     int T;

     #ifdef LOCAL

     freopen("data.txt",  "r",  stdin);

     freopen("out.txt",  "w",  stdout);

     #endif

     init();

     work();

     return ;

 }