#include <stdio.h>
#include <map>

#define Z (1 << 30)
std::map<int, long long> S;

void update(int k, int v) {
    for (int i = k + 1; i <= 1000000000; i += i & -i) S[i] += v;
}

long long query(int k) {
    long long o = 0;
    for (int i = k + 1; i > 0; i -= i & -i) o += S[i];
    return o;
}

int main() {
    int N;
    scanf("%d", &N);
    long long ans = 0;
    while (N--) {
        int t;
        scanf("%d", &t);
        if (t == 0) {
            int x, y;
            scanf("%d %d", &x, &y);
            update(x, y);
        } else {
            int l, r;
            scanf("%d %d", &l, &r);
            ans += query(r) - query(l - 1);
        }
    }
    printf("%lld\n", ans);
    return 0;
}