#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
struct node{
	ll l,r;
	ll sum;
	ll ly;
}tr[N<<2];
void pushup(int u)
{
	tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
	tr[u].ly=(tr[u<<1|1].ly&tr[u<<1].ly);
}
void build(int u,int l,int r)
{
	tr[u]={l,r};
	if(l==r){
		cin>>tr[u].sum;
		tr[u].ly=(tr[u].sum==1||tr[u].sum==0);
		return;
	}
		ll mid=l+r>>1;
		build(u<<1,l,mid);
		build(u<<1|1,mid+1,r);
		pushup(u);
}
void modify(int u,int l,int r)
{
	if(tr[u].ly)return;
	if(tr[u].l==tr[u].r)
	{
		tr[u].sum=sqrt(tr[u].sum);
		tr[u].ly=(tr[u].sum==1||tr[u].sum==0);
		return;
	}
	ll mid=(tr[u].l+tr[u].r)>>1;
	if(l<=mid)modify(u<<1,l,r);
	if(r>mid)modify(u<<1|1,l,r);
	pushup(u);
}
ll query(int u,int l,int r)
{
	if(l<=tr[u].l&&tr[u].r<=r)
		return tr[u].sum;
	ll mid=(tr[u].l+tr[u].r)>>1;
	ll ans=0;
	if(l<=mid)ans+=query(u<<1,l,r);
	if(r>mid)ans+=query(u<<1|1,l,r);
	return ans;
	
}
int main()
{
//	freopen("666.in","r",stdin);
//  freopen("tiaotq.out","w",stdout);
	ll n;
	cin>>n;
	build(1,1,n);
	ll m;
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		ll k,l,r;
		cin>>k>>l>>r;
		if(k==0)

			modify(1,l,r);
		else
			cout<<query(1,l,r)<<endl;
	}
}