B"Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, xe2 x80 x890) is located in the bottom-left corner, Ox axis is directed right, Oy axis is directed up. Pete gives Bob requests of three types: Bob managed to answer the requests, when they were 10, 100 or 1000, but when their amount grew up to 2 xc2 xb7105, Bob failed to cope. Now he needs a program that will answer all Pete's requests. Help Bob, please! The first input line contains number n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105) -- amount of requests. Then there follow n lines -- descriptions of the requests. add x y describes the request to add a point, remove x y -- the request to erase a point, find x y -- the request to find the bottom-left point. All the coordinates in the input file are non-negative and don't exceed 109. For each request of type find x y output in a separate line the answer to it -- coordinates of the bottommost among the leftmost marked points, lying strictly above and to the right of point (x, xe2 x80 x89y). If there are no points strictly above and to the right of point (x, xe2 x80 x89y), output -1."...