#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#define LL long long
#define maxn 100010
using namespace std;
LL ma[maxn*4],a[maxn],n,m,op,x,y,c[maxn];
void maketree(LL p,LL l,LL r){
	if(l==r){ma[p]=l;return;}
	LL mid=(l+r)>>1;
	maketree(p*2,l,mid);maketree(p*2+1,mid+1,r);
	if(a[ma[p*2]]>1)ma[p]=ma[p*2];
	else ma[p]=ma[p*2+1];
	return;
}
LL getwz(LL p,LL l,LL r,LL l1,LL r1){
	if(l1==l&&r1==r)return ma[p];
	LL mid=(l+r)>>1;
	if(mid>=r1)return getwz(p*2,l,mid,l1,r1);
	if(mid<l1)return getwz(p*2+1,mid+1,r,l1,r1);
	LL a1=getwz(p*2,l,mid,l1,mid),a2=getwz(p*2+1,mid+1,r,mid+1,r1);
	if(a[a1]>1)return a1;
	return a2;	
}
void insert(LL p,LL l,LL r,LL a1){
	if(l==r)return;
	LL mid=(l+r)>>1;
	if(a1<=mid)insert(p*2,l,mid,a1);
	else insert(p*2+1,mid+1,r,a1);
	if(a[ma[p*2]]>1)ma[p]=ma[p*2];
	else ma[p]=ma[p*2+1];
	return;	
}
int main(){
	freopen("hssqrt.in","r",stdin);
	freopen("hssqrt.out","w",stdout);
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j+=(j&-j))c[j]+=a[i];
	maketree((LL)1,(LL)1,n);
	scanf("%lld",&m);
	while(m--){
		scanf("%lld",&op);
		if(op==0){
			scanf("%lld%lld",&x,&y);
			if(x>y)swap(x,y);
			LL a1=getwz(1,1,n,x,y);
			while(a[a1]>1){
				for(int i=a1;i<=n;i+=(i&-i))c[i]-=a[a1];
				a[a1]=(LL)sqrt((double)a[a1]);insert(1,1,n,a1);
				for(int i=a1;i<=n;i+=(i&-i))c[i]+=a[a1];
				if(a1!=y)a1=getwz(1,1,n,a1+1,y);
				else a1=0;
			}
		}
		else{
			scanf("%lld%lld",&x,&y);
			if(x>y)swap(x,y);
		    LL ans=0;
			for(int i=y;i;i-=(i&-i))ans+=c[i];
			for(int i=x-1;i;i-=(i&-i))ans-=c[i];
			printf("%lld\n",ans);
		}
	}
	return 0;
}