#include <bits/stdc++.h> 
using namespace std; 
using int128  = __int128_t; 
using int64   = long long; 
using int32   = int; 
using uint128 = __uint128_t; 
using uint64  = unsigned long long; 
using uint32  = unsigned int; 

#define ALL(obj) (obj).begin(),(obj).end() 
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>; 

constexpr int64 MOD = 1'000'000'000LL + 7; //' 
constexpr int64 MOD2 = 998244353; 
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL; 
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //' 
constexpr long double PI = 3.1415926535897932384626433L; 

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} 
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} 
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} 
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} 
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} 
void print(void) {cout << endl;} 
template <class Head> void print(Head&& head) {cout << head;print();} 
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} 
template <class T> void chmax(T& a, const T b){a=max(a,b);} 
template <class T> void chmin(T& a, const T b){a=min(a,b);} 
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} 
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;} 
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b) 
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} 
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} 
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} 

/*
 * @title DynamicSegmentTree - 非再帰抽象化動的セグメント木
 * @docs md/segment/DynamicSegmentTree.md
 */
template<class Operator> class DynamicSegmentTree {
    using TypeNode = typename Operator::TypeNode; 
    using i64 = long long;

    struct Node{
        Node *left, *right;
        TypeNode val;
        i64 l,r;
        Node(i64 l,i64 r):left(nullptr),right(nullptr),val(Operator::unit_node),l(l),r(r) {}
    };
    
    i64 length;
    Node *root;
    void print(Node *node) {
        if (node==nullptr) return;
        print(node->left);
        cout << node->val << " ";
        print(node->right);
    }
public:

    //unitで初期化
    DynamicSegmentTree(const i64 num) {
        for (length = 1; length <= num; length *= 2);
        root = new Node(0,length);
    }
    ~DynamicSegmentTree() {
        delete root;
        root = nullptr;
    }
    
    //[idx,idx+1)
    void update(i64 idx, const TypeNode var) {
        if(idx < 0 || length <= idx) return;
        Node *node = root;
        node->val = Operator::func_merge(node->val,var);

        i64 l = 0, r = length, m;
        while(r-l>1) {
            m = (r+l)>>1;
            if(idx<m) {
                r = m;
                if(!node->left) node->left=new Node(l,r);
                node = node->left;
            }
            else {
                l = m;
                if(!node->right) node->right = new Node(l,r);
                node = node->right;
            }
            node->val = Operator::func_merge(node->val,var);
        }
    }

    //[l,r)
    TypeNode get(i64 l, i64 r) {
        if (l < 0 || length <= l || r < 0 || length < r) return Operator::unit_node;
        TypeNode val = Operator::unit_node;
        stack<Node*> st;
        st.push(root);
        while(st.size()) {
            Node *node = st.top(); st.pop();
            if(l <= node->l && node->r <= r) {
                val = Operator::func_node(val,node->val);
            }
            else if(!(node->r <= l) && !(r <= node->l)) {
                if(node->right) st.push(node->right);
                if(node->left) st.push(node->left);
            }
        }
        return val;
    }

    void print() {
        cout << "{";
        print(this->root);
        cout << "}" << endl;
    }
};

//一点加算 区間総和
template<class T> struct NodeSumPointAdd {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = 0;
    inline static constexpr TypeNode func_node(TypeNode l,TypeNode r){return l+r;}
    inline static constexpr TypeNode func_merge(TypeNode l,TypeNode r){return l+r;}
};

/*
 * @title BinaryIndexedTree
 * @docs md/segment/BinaryIndexedTree.md
 */
template<class Operator> class DynamicBinaryIndexedTree {
	using TypeNode = typename Operator::TypeNode;
    using i64 = long long;
	size_t depth;         
	i64 length;
	i64 num;

    unordered_map<i64,TypeNode> node;
public:
	
	//[0,N) constructed, inplace [0,1) + [1,N+1)
	//you can ignore inplace offset
	DynamicBinaryIndexedTree(const i64 num) : num(num) {
		for (depth = 1,length = 1; length < num; depth++,length *= 2);
	}
 
	//[idx,idx+1) update 
	void update(i64 idx, TypeNode var) {
		assert(0 <= idx && idx < length);
		for (++idx; idx <= length; idx += idx & -idx) node[idx] = Operator::func_node(node[idx],var);
	}

	//[0,idx) get
	TypeNode get(i64 idx) {
		TypeNode ret = Operator::unit_node;
		for (idx = min(length,idx); idx > 0; idx -= idx & -idx) ret = Operator::func_node(ret,node[idx]);
		return ret;
	}

	//[l,r) get
	TypeNode get(i64 l, i64 r) {
        TypeNode val = get(r);
        if(l>0) val = Operator::func_node_inv(val,get(l-1));
        return val;
	}

	void print() {
		cout << "{ " << get(1);
		for(int i = 1; i < length; ++i) cout << ", " << get(i+1);
		cout << " }" << endl;
	}
};

template<class T> struct NodePrefixSumPointAdd {
	using TypeNode = T;
	inline static constexpr TypeNode unit_node = 0;
	inline static constexpr TypeNode func_node(const TypeNode& l,const TypeNode& r){return l+r;}
	inline static constexpr TypeNode func_node_inv(const TypeNode& l,const TypeNode& r){return l-r;}
};

/** 
 * @url  
 * @est 
 */  
int main() { 
    cin.tie(0);ios::sync_with_stdio(false);
    DynamicBinaryIndexedTree<NodePrefixSumPointAdd<int64>> seg(1000000010);
    int N; cin >> N;
    int64 ans = 0;
    while(N--) {
        int q,l,r; cin >> q >> l >> r;
        if(q==0) seg.update(l,r);
        else ans += seg.get(l,r+1);
    }
    cout << ans << endl;
    return 0; 
}