Problem: Fedya and Sasha are friends, that's why Sasha knows everything about Fedya.

Fedya keeps his patience in an infinitely large bowl. But, unlike the bowl, Fedya's patience isn't infinite, that is why let v be the number of liters of Fedya's patience, and, as soon as v becomes equal to 0, the bowl will burst immediately. There is one tap in the bowl which pumps s liters of patience per second. Notice that s can be negative, in that case, the tap pumps out the patience. Sasha can do different things, so he is able to change the tap's speed. All actions that Sasha does can be represented as q queries. There are three types of queries:

  1. "1 t s" — add a new event, means that starting from the t-th second the tap's speed will be equal to s. 
  2. "2 t" — delete the event which happens at the t-th second. It is guaranteed that such event exists. 
  3. "3 l r v" — Sasha wonders: if you take all the events for which l ≤ t ≤ r and simulate changes of Fedya's patience from the very beginning of the l-th second till the very beginning of the r-th second inclusive (the initial volume of patience, at the beginning of the l-th second, equals to v liters) then when will be the moment when the bowl will burst. If that does not happen, then the answer will be -1. 



Since Sasha does not want to check what will happen when Fedya's patience ends, and he has already come up with the queries, he is asking you to help him and find the answer for each query of the 3-rd type.

It is guaranteed that at any moment of time, there won't be two events which happen at the same second.

Input

The first line contans one integer q (1 ≤ q ≤ 10^5) — the number of queries.

Each of the next q lines have one of the following formats:

  * 1 t s (1 ≤ t ≤ 10^9, -10^9 ≤ s ≤ 10^9), means that a new event is added, which means that starting from the t-th second the tap's speed will be equal to s. 
  * 2 t (1 ≤ t ≤ 10^9), means that the event which happens at the t-th second must be deleted. Guaranteed that such exists. 
  * 3 l r v (1 ≤ l ≤ r ≤ 10^9, 0 ≤ v ≤ 10^9), means that you should simulate the process from the very beginning of the l-th second till the very beginning of the r-th second inclusive, and to say when will the bowl burst. 



It is guaranteed that t, s, l, r, v in all the queries are integers.

Also, it is guaranteed that there is at least one query of the 3-rd type, and there won't be a query of the 1-st type with such t, that there already exists an event which happens at that second t.

Output

For each query of the 3-rd type, print in a new line the moment when the bowl will burst or print -1 if it won't happen.

Your answer will be considered correct if it's absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.

Examples

Input


6
1 2 1
1 4 -3
3 1 6 1
3 1 6 3
3 1 6 4
3 1 6 5


Output


5
5.666667
6
-1


Input


10
1 2 2
1 4 4
1 7 -10
3 2 4 1
3 5 6 0
3 1 15 1
2 4
3 1 15 1
1 8 1
3 1 15 1


Output


-1
5
8.7
8.1
-1


Input


5
1 1000 9999999
1 2000 -9999
3 1000 2000 0
2 1000
3 1000 2002 1


Output


1000
2000.0001

Note

In the first example all the queries of the 3-rd type cover all the events, it's simulation is following:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e5 + 107;
const double pi = acos(-1.0);
const double eps = 0.0000000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline void pr2(T x, int k = 64) {
  long long i;
  for (i = 0; i < k; i++) fprintf(stderr, "%d", (x >> i) & 1);
  putchar(' ');
}
template <typename T>
inline void add_(T &A, int B, long long MOD = M) {
  A += B;
  (A >= MOD) && (A -= MOD);
}
template <typename T>
inline void mul_(T &A, long long B, long long MOD = M) {
  A = (A * B) % MOD;
}
template <typename T>
inline void mod_(T &A, long long MOD = M) {
  A %= MOD;
  A += MOD;
  A %= MOD;
}
template <typename T>
inline void max_(T &A, T B) {
  (A < B) && (A = B);
}
template <typename T>
inline void min_(T &A, T B) {
  (A > B) && (A = B);
}
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
  T ret = 1;
  for (; b; b >>= 1ll, a = (long long)a * a % M)
    if (b & 1) ret = (long long)ret * a % M;
  return ret;
}
int startTime;
void startTimer() { startTime = clock(); }
void printTimer() {
  fprintf(stderr, "/--- Time: %ld milliseconds ---/\n", clock() - startTime);
}
struct node {
  int l, r;
  int lpos, rm, value;
  long long maxused, used;
  node() : lpos(0), rm(0), value(0), maxused(0), used(0) { l = r = 0; };
} T[maxn * 50];
int tot;
void merge(node &ret, node A, node B) {
  if (!A.lpos) {
    ret.lpos = B.lpos;
    ret.rm = B.rm;
    ret.value = B.value;
    ret.maxused = B.maxused;
    ret.used = B.used;
    return;
  }
  if (!B.lpos) {
    ret.lpos = A.lpos;
    ret.rm = A.rm;
    ret.value = A.value;
    ret.maxused = A.maxused;
    ret.used = A.used;
    return;
  }
  ret.maxused =
      max(A.maxused, A.used + (long long)(B.rm - A.lpos) * A.value + B.maxused);
  ret.lpos = B.lpos;
  ret.value = B.value;
  ret.rm = A.rm;
  ret.used = A.used + (long long)(B.rm - A.lpos) * A.value + B.used;
}
int root;
int op, t, s, l, r, v;
void update(int &x, int L, int R) {
  if (!x) x = ++tot;
  if (L == R) {
    if (op == 1)
      T[x].lpos = T[x].rm = t, T[x].value = s;
    else
      T[x].lpos = T[x].rm = 0, T[x].value = 0;
    return;
  }
  int mid = (L + R) / 2;
  if (t <= mid)
    update(T[x].l, L, mid);
  else
    update(T[x].r, mid + 1, R);
  merge(T[x], T[T[x].l], T[T[x].r]);
}
double ans;
node now;
void query(int x, int L, int R) {
  if (ans >= 0) return;
  if (l <= L && R <= r) {
    if (T[x].lpos) {
      if (now.used + (long long)(T[x].rm - now.lpos) * now.value >= v) {
        if (now.value <= 0)
          ans = now.lpos;
        else
          ans = now.lpos + 1. * (v - now.used) / now.value;
        return;
      }
      node tmp;
      merge(tmp, now, T[x]);
      if (tmp.maxused >= v) {
        int mid = (L + R) / 2;
        query(T[x].l, L, mid);
        query(T[x].r, mid + 1, R);
        if (ans >= 0) return;
        puts("-100");
      } else {
        now = tmp;
      }
    }
    if (now.used + (long long)(R - now.lpos) * now.value >= v) {
      if (now.value <= 0)
        ans = now.lpos;
      else
        ans = now.lpos + 1. * (v - now.used) / now.value;
    }
    return;
  }
  int mid = (L + R) / 2;
  if (l <= mid) query(T[x].l, L, mid);
  if (mid < r) query(T[x].r, mid + 1, R);
}
int main() {
  int q, i;
  scanf("%d", &q);
  for (i = 1; i <= q; i++) {
    scanf("%d", &op);
    if (op == 1) {
      scanf("%d%d", &t, &s);
      s = -s;
      update(root, 1, 1000000000);
    } else if (op == 2) {
      scanf("%d", &t);
      update(root, 1, 1000000000);
    } else {
      scanf("%d%d%d", &l, &r, &v);
      ans = -1;
      now = node();
      now.lpos = l;
      query(root, 1, 1000000000);
      if (ans > r) puts("-10000");
      printf("%.10f\n", ans);
    }
  }
}