#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n;i++) {
cin >> a[i];
}
vector<ll> pref(n + 1, 0);
for (int i = 1; i <= n;i++) pref[i] = pref[i - 1] + a[i];
int q;
cin >> q;
while (q--) {
int qt;
cin >> qt;
if (qt == 1) {
for (int i = 1; i < n;i++) {
if (a[i] > a[i + 1]) swap(a[i], a[i + 1]);
}
pref.resize(n + 1, 0);
for (int i = 1; i <= n;i++) pref[i] = pref[i - 1] + a[i];
}else {
int l, r;
cin >> l >> r;
cout << pref[r] - pref[l - 1] << "\n";
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
//cin >> t;
while (t--) {
solve();
cout << "\n";
}
return 0;
}
