3327

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <climits>

//#pragma GCC optimize("O3, unroll-loops");

#include <list>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <unordered_set>

//#include <chrono>
//#include <fstream>
//#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> veci;
typedef vector<bool> vecb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;

const int INF_I = 1e9;
const ll INF_LL = 1e18;

veci mod;
veci a;
int n;

void build(int c = 1, int tl = 0, int tr = n - 1) {
    if (tl == tr) {
        mod[c] = a[tl];
        return;
    }
    int tm = (tl + tr) >> 1;
    build(c << 1, tl, tm);
    build((c << 1) + 1, tm + 1, tr);
}

void update(int l, int r, int add, int c = 1, int tl = 0, int tr = n - 1) {
    if (l > r)
        return;
    if (tl == l && tr == r) {
        mod[c] += add;
        return;
    }
    int tm = (tl + tr) >> 1;
    update(l, min(r, tm), add, c << 1, tl, tm);
    update(max(l, tm + 1), r, add, (c << 1) + 1, tm + 1, tr);
}

int get(int pos, int c = 1, int tl = 0, int tr = n - 1) {
    if (tl == tr)
        return mod[c];
    int tm = (tl + tr) >> 1;
    if (pos <= tm)
        return mod[c] + get(pos, c << 1, tl, tm);
    return mod[c] + get(pos, (c << 1) + 1, tm + 1, tr);
}

int main() {
    /*ifstream cin("in.txt");
    ofstream cout("out.txt");
    auto start_time = chrono::high_resolution_clock::now();*/

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    int m;
    cin >> n;

    mod.assign(n << 2, 0);
    a.assign(n, 0);
    FOR(i, 0, n)
        cin >> a[i];
    build();
    cin >> m;
    for (int i = 0; i < m; i++) {
        char ch;
        cin >> ch;
        if (ch == 'g') {
            int in;
            cin >> in;
            cout << get(--in) << "\n";
        }
        else {
            int l, r, add;
            cin >> l >> r >> add;
            update(--l, --r, add);
        }
    }

    /*auto end_time = chrono::high_resolution_clock::now();
    chrono::duration<double> duration = end_time - start_time;
    cout << duration.count() << "\n";
    cin.close();
    cout.close();*/
    return 0;
}