#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005;
int q;
const int N = 1e9;
int idx = 0;
int root, ls[50 * mxN], rs[50 * mxN], bor[50 * mxN], lenj[50 * mxN];
void propagate(int v, int tl, int tr){
if(lenj[v] != 0){
bor[v] = (tr - tl + 1);
if(tl != tr){
if(!ls[v])ls[v] = ++idx;
lenj[ls[v]] = lenj[v];
if(!rs[v])rs[v] = ++idx;
lenj[rs[v]] = lenj[v];
}
lenj[v] = 0;
}
}
void lazyupd(int &v, int tl, int tr, int l, int r, int val){
if(tl > tr || l > tr || tl > r)return;
if(!v)v = ++idx;
propagate(v, tl, tr);
if(tl >= l && tr <= r){
lenj[v] = val; propagate(v, tl, tr);
return;
}
int mid = (tl + tr) / 2;
lazyupd(ls[v], tl, mid, l, r, val); lazyupd(rs[v], mid + 1, tr, l, r, val);
bor[v] = bor[ls[v]] + bor[rs[v]];
}
int kveri(int v, int tl, int tr, int l, int r){
if(!v || tl > r || l > tr)return 0;
propagate(v, tl, tr);
if(tl >= l && tr <= r)return bor[v];
int mid = (tl + tr) / 2;
return kveri(ls[v], tl, mid, l, r) + kveri(rs[v], mid + 1, tr, l, r);
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> q; int last = 0;
while(q--){
int t, l, r;
cin >> t >> l >> r; l += last; r += last;
if(t == 1){
last = kveri(root,1,N,l,r);
cout << last << '\n';
}
else{
lazyupd(root,1,N,l,r,1);
}
}
return 0;
}
/*
3
2 5 8
2 7 10
1 1 10
4
2 2 3
1 1 3
2 2 3
1 -1 3
6
2 1 7
2 10 12
1 7 11
2 11 13
1 8 10
1 15 17
// probati bojenje sahovski
*/
