B"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: 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. 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: 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 . 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} . In the first example all the queries of the 3 -rd type cover all the events, it's simulation is following: "...