rt

#include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 5;
const int M = 2e6 + 5;
int n, m, a[N], f[M];

void build(int k, int l, int r) {
	if (l == r) {
		f[k] = a[l];
		return;
	}
	
	int mid = (l + r) >> 1;
	build(k + k, l, mid);
	build(k + k + 1, mid, r);
	f[k] = f[k + k] + f[k + k + 1];
}

void add(int k, int l, int r, int x, int y) {
	f[k] += y;
	if (l == r)
		return;
	
	int mid = (l + r) >> 1;
	if (x <= m)
		add(k + k, l, mid, x, y);
	else
		add(k + k + 1, mid + 1, r, x, y); 
}

int calc(int k, int l, int r, int s, int t) {
	if (l == s && r == t)
		return f[k];
	
	int mid = (l + r) >> 1;
	
	if (t <= m)
		return calc(k + k, l, mid, s, t);
	else
		if (s > m)
			return calc(k + k + 1, mid + 1, r, s, t);
		else
			return calc(k + k, l, mid, s, mid) + calc(k + k + 1, mid + 1, r, mid + 1, t);	
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; ++i)
		cin >> a[i];
	
	build(1, 1, n);
	
	for (int i = 1; i <= m; ++i) {
		int t, x, y;
		cin >> t >> x >> y;
		if (t == 1)
			add(1, 1, n, x, y);
		else
			cout << calc(1, 1, n, x, y) << endl;
	}
}