#include <bits/stdc++.h>
 
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
 
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
 
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
 
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)

//ここから編集

struct SegmentTree {
  struct Node {
    Node *left, *right;
    ll v;
    Node() : left(nullptr), right(nullptr), v(0) {}  
  };

  Node * root;
  int n, n0;

  SegmentTree(int n) : n(n) {
    n0 = 1;
    while(n0 < n) n0 <<= 1;
    root = new Node();
  }
  
  ~SegmentTree() {
    delete root; root = nullptr;
  }

  void update(int k, ll x){
    Node *n = root;  
    int l = 0, r = n0;
    n->v = (n->v + x) % MOD;
    while(r-l>1){
      int m = (l+r)>>1;
      if(k < m){
        if(!n->left) n->left = new Node();
        n = n->left;

        r = m;
      } else {
        if(!n->right) n->right = new Node();
        n = n->right;

        l = m;
      }

      n->v = (n->v + x) % MOD;
    }
  }

  ll query(int a, int b, Node *n, int l, int r) {
    if(a <= l && r <= b) {
      return n-> v;
    }
    if(r <= a || b <= l){
      return 0;
    }

    ll lv = n->left ? query(a, b, n->left, l, (l+r)>>1) : 0;
    ll rv = n->right ? query(a, b, n->right, (l+r)>>1, r) : 0;
    return (lv+rv) % MOD;
  }

  ll query(int a, int b){
    return query(a, b, root, 0, n0);
  }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(5);
  

  int N; cin >> N;
  SegmentTree seg((1<<30));
  ll ans = 0;
  REP(i,N){
    int q; cin >> q;
    if(q == 0){
      int x, y; cin >> x >> y;
      seg.update(x, y);
    }else{
      int l, r; cin >> l >> r;
      ans += seg.query(l, r+1);
      
    }
  }
  cout << ans << endl;
  return 0;
}