#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct node
{
int l = 0;
int r = (1<<30)-1;
node* left = NULL;
node* right = NULL;
ll sum = 0;
int cnt = 0;
void sons()
{
if(left == NULL)
{
left = new node;
left -> l = l;
left -> r = (l+r)/2;
right = new node;
right -> l = (l+r)/2+1;
right -> r = r;
}
}
ll get_kth_sum(int k)
{
if(l == r) return (ll)l*min((ll)k,(ll)cnt);
sons();
if(left->cnt >= k) return left->get_kth_sum(k);
return right->get_kth_sum(k-left->cnt)+left->sum;
}
void add(int x)
{
cnt++;
sum += x;
if(l == r) return;
sons();
if(x <= (l+r)/2) left -> add(x);
else right -> add(x);
}
};
struct query
{
int ind,p,s;
};
int arr[500001];
ll query_ans[500001];
vector<query> queries[500001];
node segtree;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
rep2(i,1,n) cin >> arr[i];
int q;
cin >> q;
int cnt = 0;
rep(qq,q)
{
int t;
cin >> t;
if(t == 1) cnt++;
else
{
int l,r;
cin >> l >> r;
queries[min(n,l-1+cnt)].pb({qq,-1,l-1});
queries[min(n,r+cnt)].pb({qq,1,r});
}
}
rep2(i,0,n)
{
if(i != 0) segtree.add(arr[i]);
forall(it,queries[i]) query_ans[it.ind] += segtree.get_kth_sum(it.s)*it.p;
}
rep(qq,q)
{
if(query_ans[qq] != 0) cout << query_ans[qq] << "\n";
}
}
