#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpdd = vector<pdd>;
using vvpdd = vector<vpdd>;
template <typename T>
void ckmin(T& a, const T& b) {
  a = min(a, b);
}
template <typename T>
void ckmax(T& a, const T& b) {
  a = max(a, b);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
namespace __input {
template <class T1, class T2>
void re(pair<T1, T2>& p);
template <class T>
void re(vector<T>& a);
template <class T, size_t SZ>
void re(array<T, SZ>& a);
template <class T>
void re(T& x) {
  cin >> x;
}
void re(double& x) {
  string t;
  re(t);
  x = stod(t);
}
template <class Arg, class... Args>
void re(Arg& first, Args&... rest) {
  re(first);
  re(rest...);
}
template <class T1, class T2>
void re(pair<T1, T2>& p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T>& a) {
  for (int i = 0; i < (int((a).size())); i++) re(a[i]);
}
template <class T, size_t SZ>
void re(array<T, SZ>& a) {
  for (int i = 0; i < (SZ); i++) re(a[i]);
}
}  // namespace __input
using namespace __input;
namespace __output {
template <class T1, class T2>
void pr(const pair<T1, T2>& x);
template <class T, size_t SZ>
void pr(const array<T, SZ>& x);
template <class T>
void pr(const vector<T>& x);
template <class T>
void pr(const deque<T>& x);
template <class T>
void pr(const set<T>& x);
template <class T1, class T2>
void pr(const map<T1, T2>& x);
template <class T1, class T2>
void pr(const map<T1, T2, greater<int>>& x);
template <class T>
void pr(const T& x) {
  cout << x;
}
template <class Arg, class... Args>
void pr(const Arg& first, const Args&... rest) {
  pr(first);
  pr(rest...);
}
template <class T1, class T2>
void pr(const pair<T1, T2>& x) {
  pr("{", x.first, ", ", x.second, "}");
}
template <class T, bool pretty = true>
void prContain(const T& x) {
  if (pretty) pr("{");
  bool fst = 1;
  for (const auto& a : x) pr(!fst ? pretty ? ", " : " " : "", a), fst = 0;
  if (pretty) pr("}");
}
template <class T>
void pc(const T& x) {
  prContain<T, false>(x);
  pr("\n");
}
template <class T, size_t SZ>
void pr(const array<T, SZ>& x) {
  prContain(x);
}
template <class T>
void pr(const vector<T>& x) {
  prContain(x);
}
template <class T>
void pr(const deque<T>& x) {
  prContain(x);
}
template <class T>
void pr(const set<T>& x) {
  prContain(x);
}
template <class T1, class T2>
void pr(const map<T1, T2>& x) {
  prContain(x);
}
template <class T1, class T2>
void pr(const map<T1, T2, greater<int>>& x) {
  prContain(x);
}
void ps() { pr("\n"); }
template <class Arg>
void ps(const Arg& first) {
  pr(first);
  ps();
}
template <class Arg, class... Args>
void ps(const Arg& first, const Args&... rest) {
  pr(first, " ");
  ps(rest...);
}
}  // namespace __output
using namespace __output;
namespace __algorithm {
template <typename T>
void dedup(vector<T>& v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), v.end());
}
template <typename T>
typename vector<T>::iterator find(vector<T>& v, const T& x) {
  auto it = lower_bound((v).begin(), (v).end(), x);
  return it != v.end() && *it == x ? it : v.end();
}
template <typename T>
size_t index(vector<T>& v, const T& x) {
  auto it = find(v, x);
  assert(it != v.end() && *it == x);
  return it - v.begin();
}
template <typename C, typename T, typename OP>
vector<T> prefixes(const C& v, T id, OP op) {
  vector<T> r(int((v).size()) + 1, id);
  for (int i = 0; i < (int((v).size())); i++) r[i + 1] = op(r[i], v[i]);
  return r;
}
template <typename C, typename T, typename OP>
vector<T> suffixes(const C& v, T id, OP op) {
  vector<T> r(int((v).size()) + 1, id);
  for (int i = (int((v).size())) - 1; i >= 0; i--) r[i] = op(v[i], r[i + 1]);
  return r;
}
}  // namespace __algorithm
using namespace __algorithm;
struct monostate {
  friend istream& operator>>(istream& is,
                             const __attribute__((unused)) monostate& ms) {
    return is;
  }
  friend ostream& operator<<(ostream& os,
                             const __attribute__((unused)) monostate& ms) {
    return os;
  }
} ms;
template <typename W = monostate>
struct wedge {
  int u, v, i;
  W w;
  wedge<W>(int _u = -1, int _v = -1, int _i = -1) : u(_u), v(_v), i(_i) {}
  int operator[](int loc) const { return u ^ v ^ loc; }
  friend void re(wedge& e) {
    re(e.u, e.v, e.w);
    --e.u, --e.v;
  }
  friend void pr(const wedge& e) { pr(e.u, "<-", e.w, "->", e.v); }
};
namespace __io {
void setIn(string second) { freopen(second.c_str(), "r", stdin); }
void setOut(string second) { freopen(second.c_str(), "w", stdout); }
void setIO(string second = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(15);
  if (int((second).size())) {
    setIn(second + ".in"), setOut(second + ".out");
  }
}
}  // namespace __io
using namespace __io;
template <typename T>
void add(T& make_pair, int k, int v) {
  auto it = make_pair.find(k);
  if (it == make_pair.end())
    make_pair[k] = v;
  else if (it->second + v == 0)
    make_pair.erase(it);
  else
    it->second += v;
}
int main() {
  setIO();
  struct block {
    int bl, br, SZ;
    ll totD = 0;
    int cA = INT_MAX, cB = INT_MIN;
    vi hA, hB;
    map<int, int> B, Bo;
    map<int, int, greater<int>> A, Ao;
    int no;
    block(int _bl, int _br) : bl(_bl), br(_br), SZ(br - bl), no(SZ) {
      hA.resize(SZ, INT_MAX);
      hB.resize(SZ, INT_MIN);
    }
    void refresh() {
      for (int i = 0; i < (SZ); i++) ckmin(hA[i], cA), ckmax(hB[i], cB);
    }
    void record(int i, int v) {
      if (hA[i] == INT_MAX) {
        if (hB[i] == INT_MIN)
          no += v;
        else
          add(Bo, hB[i], v);
      } else {
        if (hB[i] == INT_MIN)
          add(Ao, hA[i], v);
        else {
          add(A, hA[i], v), add(B, hB[i], v);
          totD += (hA[i] - hB[i]) * v;
        }
      }
    }
    void put_snake(const int sl, const int sr, const int sy) {
      if (sr <= bl || br <= sl) return;
      if (sl <= bl && br <= sr) {
        if (sy < 0) {
          ckmax(cB, sy);
          int mv = 0;
          for (auto it = Bo.begin(); it != Bo.end() && it->first < sy;
               Bo.erase(it++))
            mv += it->second;
          if (mv + no) Bo[sy] += mv + no;
          no = 0;
          mv = 0;
          for (auto& p : Ao) {
            A[p.first] += p.second;
            mv += p.second;
            totD += ll(p.first - sy) * p.second;
          }
          Ao.clear();
          for (auto it = B.begin(); it != B.end() && it->first < sy;
               B.erase(it++)) {
            totD -= (sy - it->first) * ll(it->second);
            mv += it->second;
          }
          if (mv) B[sy] += mv;
        } else {
          ckmin(cA, sy);
          int mv = 0;
          for (auto it = Ao.begin(); it != Ao.end() && it->first > sy;
               Ao.erase(it++))
            mv += it->second;
          if (mv + no) Ao[sy] += mv + no;
          no = 0;
          mv = 0;
          for (auto& p : Bo) {
            mv += p.second;
            B[p.first] += p.second;
            totD += ll(sy - p.first) * p.second;
          }
          Bo.clear();
          for (auto it = A.begin(); it != A.end() && it->first > sy;
               A.erase(it++)) {
            totD -= (it->first - sy) * ll(it->second);
            mv += it->second;
          }
          if (mv) A[sy] += mv;
        }
        return;
      }
      refresh();
      for (int i = (max(0, sl - bl)); i < (min(SZ, sr - bl)); i++) {
        if (sy < 0 && sy > hB[i]) {
          record(i, -1);
          hB[i] = sy;
          record(i, 1);
        }
        if (sy > 0 && sy < hA[i]) {
          record(i, -1);
          hA[i] = sy;
          record(i, 1);
        }
      }
    }
    ll get_danger(int ql, int qr) {
      if (qr <= bl || br <= ql) return 0;
      if (ql <= bl && br <= qr) return totD;
      refresh();
      ll res = 0;
      for (int i = (max(0, ql - bl)); i < (min(SZ, qr - bl)); i++) {
        if (hA[i] < INT_MAX && hB[i] > INT_MIN) res += hA[i] - hB[i];
      }
      return res;
    }
  };
  const int MAXV = 1e5;
  const int BSZ = sqrt(MAXV);
  vector<block> blocks;
  for (int l = 0; l < MAXV; l += BSZ) {
    blocks.push_back(block(l, l + BSZ));
  }
  int t, l, r, k;
  int Q;
  re(Q);
  for (int q = 0; q < (Q); q++) {
    re(t, l, r);
    --l, --r;
    if (t == 1) {
      re(k);
      for (auto& b : blocks) b.put_snake(l, r, k);
    } else {
      ll ans = 0;
      for (auto& b : blocks) ans += b.get_danger(l, r);
      ps(ans);
    }
  }
  return 0;
}
