/<> 17353 (lazy propagation seg special lazy array)

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <numeric>
#include <iomanip>
using namespace std;
#define pii pair<long long, long long>
#define ll long long
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long dl[2] = {1, -1};
const long long MOD = 1000000007;
const long long MAXN = 100005;

int N, Q;
long long arr[MAXN];
long long seg[MAXN * 4];
pair<long long, long long> lazy[MAXN * 4];

long long find_sum(int a, int b, long long start, long long inc){
    int num = b + 1 - a;
    return start * num + num * (num - 1) / 2 * inc;
}

void prop(int x, int s, int e){
    if(lazy[x].second == 0) return;
    seg[x] += find_sum(s, e, lazy[x].first, lazy[x].second);
    if(s != e){
        int mid = (s + e) / 2;
        int left_num = mid + 1 - s;
        lazy[x * 2].first += lazy[x].first;
        lazy[x * 2].second += lazy[x].second;
        lazy[x * 2 + 1].first += lazy[x].first + left_num * lazy[x].second;
        lazy[x * 2 + 1].second += lazy[x].second;
    }
    lazy[x] = {0, 0};
}

void build(int x, int s, int e){
    if(s == e){
        seg[x] = arr[s];
        return;
    }
    int mid = (s + e)/2;
    build(x * 2, s, mid);
    build(x * 2 + 1, mid + 1, e);
    seg[x] = seg[x * 2] + seg[x * 2 + 1];
}

void update(int x, int s, int e, int a, int b){
    prop(x, s, e);
    if(b < s or e < a) return;
    if(a <= s and e <= b){
        lazy[x].first += 1 + s - a;
        lazy[x].second++;
        prop(x, s, e);
        return;
    }
    int mid = (s + e)/2;
    update(x * 2, s, mid, a, b);
    update(x * 2 + 1, mid + 1, e, a, b);
    seg[x] = seg[x * 2] + seg[x * 2 + 1];
}

long long query(int x, int s, int e, int idx){
    prop(x, s, e);
    if(idx < s or e < idx) return 0;
    if(s == e) return seg[x];
    int mid = (s + e)/2;
    return query(x * 2, s, mid, idx) + query(x * 2 + 1, mid + 1, e, idx);
}


int main() {
    FAST;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> arr[i];
    }
    build(1, 1, N);
    cin >> Q;
    for(int a, b, i = 0; i < Q; i++){
        cin >> a >> b;
        if(a == 1){
            int c;
            cin >> c;
            update(1, 1, N, b, c);
        }
        else{
            cout << query(1, 1, N, b) << "\n";
        }
    }
}

/*
5
1 2 1 2 1
4
1 1 5
2 5
1 2 5
2 5
 */