#include "bits/stdc++.h" using namespace std; /* macro */ #define rep(i,a,b) for(int i=a;i b; i--) //#define int long long #define exist(s,e) ((s).find(e)!=(s).end()) #define all(v) (v).begin(), (v).end() #define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++) //#define sum(v) accumulate(all(v), (0LL)) #define isin(a, b, c) (b <= a && a <= c) #define println cout << "\n"; #define sz(v) (int)v.size() #define bin(x) static_cast >(x) /* alias */ template using vec = vector; typedef vector vi; typedef pair pi; typedef tuple ti; typedef map mi; typedef set si; /* constant */ const int inf = 1LL << 62; const int mod = 1e9 + 7; const int dx[8]={1,0,-1,0,-1,1,-1,1}; const int dy[8]={0,1,0,-1,-1,-1,1,1}; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; /* io_method */ int input(){int tmp;cin >> tmp;return tmp;} string raw_input(){string tmp;cin >> tmp;return tmp;} template void printx(T n){cout << n;} template void printx(pair p){cout << "(" << p.first << "," << p.second << ")";} template void printx(tuple t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;} template void printx(vector v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";} template void print(T n){printx(n);cout << endl;} template void print(set s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;} template void print(map mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;} template void printans(vec v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;} /* general_method */ templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (bT cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);} /* math_method */ int ceil(int a, int b){return a / b + (a % b > 0);} /* main */ int q; vec query; vi tmp; mi mp; void in(){ cin >> q; rep(i,0,q){ int a, b, c; cin >> a >> b >> c; query.push_back({a, b, c}); tmp.push_back(b); if(a == 1) tmp.push_back(c); } sort(all(tmp)); tmp.erase(unique(all(tmp)), tmp.end()); rep(i,0,sz(tmp)){ mp[tmp[i]] = i; } } struct BIT { const int N; vector dat; explicit BIT(int n): N(n), dat(N+1, 0) {} int s(int l, int r) { return sum(r) - sum(l-1); } int sum(int i) { return (i>0)? (sum(i - (i&-i)) + dat[i]) : 0; } void add(int i, int v) { for(; i <= N; i += i&-i) dat[i] += v; } }; void solve(){ int ans = 0; BIT b(sz(mp) + 10); rep(i,0,q){ if(query[i][0] == 0){ b.add(mp[query[i][1]], query[i][2]); }else{ ans += b.s(mp[query[i][1]], mp[query[i][2]]); } } print(ans); } signed main(){ cin.tie(0); ios::sync_with_stdio(false); in(); solve(); }