#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long a[N], sum[N << 2], kf[N << 2];
int n, m;
void build(int k, int l, int r){
	if(l == r){
		sum[k] = kf[k] = a[l];
		return ;
	}
	int mid = l + r >> 1;
	build(k << 1, l, mid);
	build(k << 1 | 1, mid + 1, r);
	sum[k] = sum[k << 1] + sum[k << 1 | 1];
	kf[k] = max(kf[k << 1], kf[k << 1 | 1]);
}
void change(int k, int l, int r, int x, int y){
	if(l == r && x <= l && r <= y){
		sum[k] = kf[k] = sqrt(sum[k]);
		return ;
	}
	int mid = l + r >> 1;
	if(x <= mid && kf[k << 1] > 1)change(k << 1, l, mid, x, y);
	if(y > mid && kf[k << 1 | 1] > 1)change(k << 1 | 1, mid + 1, r, x, y);
	sum[k] = sum[k << 1] + sum[k << 1 | 1];
	kf[k] = max(kf[k << 1], kf[k << 1 | 1]);
}
long long ask(int k, int l, int r, int x, int y){
	if(x <= l && r <= y)return sum[k];
	int mid = l + r >> 1;
	int res = 0;
	if(x <= mid)res += ask(k << 1, l, mid, x, y);
	if(y > mid)res += ask(k << 1 | 1, mid + 1, r, x, y);
	return res;	
}
int main(){
	cin >> n;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	build(1, 1, n);
	cin >> m;
	for(int i = 1; i <= m; i ++){
		int opt, l, r;
		cin >> opt >> l >> r;
		if(l > r)swap(l, r);
		if(opt == 0)change(1, 1, n, l, r);
		else cout << ask(1, 1, n, l, r) << endl;
	}
	return 0;
}

50分WA QAQ