#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300001;
const int k = 400;

struct sqrt_decomposition {
    long long a[MAX_N];
    long long b[MAX_N / k + 1];
    int div_k[MAX_N];
    vector<vector<int>> divisors;
    int n;

    sqrt_decomposition(int n1) {
        n = n1;
        divisors.assign(n, vector<int>());
        for (int i = 1; i < n; i++) {
            div_k[i] = i / k;
            for (long long j = 1; j * j <= i; j++) {
                if (i % j == 0) {
                    divisors[i].push_back(j);
                    if (j * j != i) divisors[i].push_back(i / j);
                }
            }
        }
        for (int i = 0; i < n; i++) a[i] = 0;
        for (int i = 0; i < n / k + 1; i++) b[i] = 0;
    }

    void add(int l, int r, int x) {
        int bl = div_k[l];
        int br = div_k[r];
        if (bl == br) {
            for (int i = l; i <= r; i++) {
                a[i] += x;
            }
        } else {
            for (int i = l; i < (bl + 1) * k; i++) {
                a[i] += x;
            }
            for (int i = br * k; i <= r; i++) {
                a[i] += x;
            }
            for (int i = bl + 1; i <= br - 1; i++) {
                b[i] += x;
            }
        }
    }

    long long get(int i) {
        int bl = div_k[i];
        return a[i] + b[bl];
    }

    long long get_power(int i) {
        long long ans = 0;
        for (int j : divisors[i]) {
            ans += get(j);
        }
        return ans;
    }
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int a[n + 1];
    int inp;
    for (int i = 1; i <= n; i++) {
        cin >> inp;
        a[i] = inp;
    }
    sqrt_decomposition sd(n + 1);
    int q;
    cin >> q;
    int t, l, r, d;
    for (int i = 0; i < q; i++) {
        cin >> t;
        if (t == 1) {
            cin >> l;
            cout << sd.get_power(l) + a[l] << '\n';
        } else {
            cin >> l >> r >> d;
            sd.add(l, r, d);
        }
    }
}