/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.12 01:06:54
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;



template< typename T >
struct BinaryIndexedTree {
    std::vector< T > data;
    BinaryIndexedTree(int sz) {
        data.assign(++sz, 0);
    }
    
    inline T sum(int k) {
        T ret = 0;
        for (++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }
    
    inline T sum(int left, int right) {
        if (left > right) return 0;
        return sum(right) - sum(left - 1);
    }
    
    
    inline void add(int k, T x) {
        for (++k; k < data.size(); k += k & -k) data[k] += x;
    }
    
    
    
    int get(ll k) {
        ++k;
        int res = 0;
        int N = 1; while (N < (int)data.size()) N *= 2;
        for (int i = N / 2; i > 0; i /= 2) {
            if (res + i < (int)data.size() && data[res + i] < k) {
                k = k - data[res + i];
                res = res + i;
            }
        }
        return res + 1;
    }
    void print() {
        std::cout << "[ ";
        for (int i = 0; i < data.size() - 1; i++) {
            std::cout << sum(i, i);
            if (i < data.size() - 2) cout << ", ";
        }
        std::cout << " ]" << endl;
    }
};
int main() {
    int n;cin >> n;
    vector<tuple<int,int,int>> query(n);
    map<int,int> mp;
    for (int i = 0; i < n; i++) {
        int t,x,y;cin >> t >> x >> y;
        query[i] = make_tuple(t,x,y);
        if (t == 0) {
            mp[x] = 0;
        }
    }
    int t = 0;
    mp[-1] = t++;
    for(auto p : mp) mp[p.first] = t++;
    mp[1000000001] = t++;
    BinaryIndexedTree<int> bit(t);
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        int q = get<0>(query[i]);
        int x = get<1>(query[i]);
        int y = get<2>(query[i]);
        if (q == 0) {
            bit.add(mp[x],y);
        }
        else {
            ans += bit.sum(mp.lower_bound(x)->second,prev(mp.upper_bound(y))->second);
        }
    }
    cout << ans << endl;
    return 0;
}