#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimization("Ofast")
#define ll long long
const int mxN = 1e9+100;
struct Node {
ll val = 0, lazy = 0;
Node* left = NULL;
Node* right = NULL;
};
typedef Node* root;
root R = new Node;
void push(root& nd, ll l, ll r) {
if (!nd){
nd=new Node;
}
if(nd->lazy==0) return;
nd->val = (r - l + 1) * nd->lazy;
if (r - l > 0) {
if (nd->left == NULL) nd->left = new Node;
if (nd->right == NULL) nd->right = new Node;
nd->left->lazy = nd->lazy;
nd->right->lazy = nd->lazy;
}
nd->lazy = 0;
}
void update(root& nd, ll start, ll end, ll l, ll r) {
push(nd, start, end);
if (start > r || end < l) return;
if (start >= l && end <= r) {
nd->lazy = 1;
push(nd, start, end);
return;
}
ll mid = start + (end - start) / 2;
update(nd->left, start, mid, l, r);
update(nd->right, mid + 1, end, l, r);
nd->val = (nd->left ? nd->left->val : 0) + (nd->right ? nd->right->val : 0);
}
ll qry(root& nd, ll start, ll end, ll l, ll r) {
push(nd, start, end);
if (start > r || end < l) return 0;
if (start >= l && end <= r) return nd->val;
ll mid = start + (end - start) / 2;
return qry(nd->left, start, mid, l, r) + qry(nd->right, mid + 1, end, l, r);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll n,prev=0,p2=1,e,l,r;cin>>n;
while(n--){
cin>>e>>l>>r;
l+=prev;
r+=prev;
if(e==1){
prev=qry(R,1,mxN,l,r);
cout<<prev<<'\n';
}else if(e==2){
update(R,1,mxN,l,r);
}
}
return 0;
}
