#include<bits/stdc++.h>
using namespace std;
// define
#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ld double
#define ii pair<int,int>
#define se second
#define fi first
#define iii pair<int,ii>
#define all(v) v.begin(),v.end()
#define bit(x,i) (((x)>>(i))&1LL)
#define flip(x,i) ((x)^(1LL<<(i)))
#define ms(d,x) memset(d,x,sizeof(d))
#define sitingfake 1
#define orz 1
//constant
const ll mod = 1e9 + 7;
const long long linf = 4557430888798830399;
const int inf = 1061109567;
const int maxarr = 1e6 + 5;
const int dx[] = {0,1,-1,0};
const int dy[] = {1,0,0,-1};
template<typename T> bool maximize(T &a, const T &b)
{
if(a < b) {a = b; return 1;}
return 0;
}
template<typename T> bool minimize(T &a, const T &b)
{
if(a > b) {a = b; return 1;}
return 0;
}
inline void Plus(ll & a ,ll b)
{
b %= mod;
a += b;
if(a >= mod) a -= mod;
if(a < 0) a += mod;
return;
}
inline void Mul(ll & a, ll b)
{
a %= mod; b %= mod;
a *= b;
a %= mod;
return;
}
//code
struct DynamicSeg
{
struct Node
{
int Data;
int Lazy;
Node *left;
Node *right;
Node()
{
left = right = NULL;
Data = Lazy = 0;
}
};
Node *root = new Node ();
const int n;
DynamicSeg (int n) : n(n) {}
void Merge(Node * cur)
{
cur -> Data = cur -> left -> Data + cur -> right -> Data;
}
void ApplySum(Node * cur , int len , int val)
{
cur -> Data = len * val;
cur -> Lazy = val;
}
void Push(Node * i ,int l ,int r, int mid)
{
if(i -> left == NULL) i -> left = new Node ();
if(i -> right == NULL) i -> right = new Node ();
if(i -> Lazy)
{
ApplySum(i -> left , mid - l + 1, i -> Lazy);
ApplySum(i -> right , r - mid , i -> Lazy);
i -> Lazy = 0;
}
}
void UpdateRange(Node * i , int l ,int r, int u ,int v , int val)
{
if(u > r || v < l) return;
if(u <= l && r <= v)
{
ApplySum(i , r - l + 1 , val);
return;
}
int mid = (r + l) >> 1;
Push(i , l , r , mid);
UpdateRange(i -> left , l , mid , u , v , val);
UpdateRange(i -> right, mid + 1, r , u , v , val);
Merge(i);
}
int GetSum(Node * i , int l ,int r, int u ,int v)
{
if(u > r || v < l) return 0;
if(u <= l && r <= v) return i -> Data;
int mid = (r + l) >> 1;
Push(i , l , r, mid);
return GetSum(i -> left , l , mid , u , v) + GetSum(i -> right , mid + 1, r, u , v);
}
// write code here
void update(int l , int r, int val)
{
UpdateRange(root , 1 , n , l , r , val);
}
int Query(int l ,int r)
{
return GetSum(root , 1 , n , l , r);
}
};
void solve(void)
{
int q , C = 0;
cin >> q;
DynamicSeg st(1e9 + 1);
while(q--)
{
int type;
cin >> type;
if(type == 1)
{
int l , r;
cin >> l >> r;
C = st.Query(l + C , r + C);
cout << C << "\n";
}
else
{
int l , r;
cin >> l >> r;
st.update(l + C , r + C, 1);
}
}
}
/**
**/
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define task ""
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int tc; tc = 1;
while(tc--) solve();
//execute;
}
