1 #include<set>
 2 #include<queue>
 3 #include<vector>
 4 #include<cstdio>
 5 #include<cstdlib>
 6 #include<cstring>
 7 #include<iostream>
 8 #include<algorithm>
 9 using namespace std;
10 const int H = 202;
11 const int L = 1002;
12 #define Ch1 ((i)<<1)
13 #define Ch2 ((Ch1)|1)
14 #define For(i,n) for(int i=1;i<=n;i++)
15 #define Rep(i,l,r) for(int i=l;i<=r;i++)
16 
17 struct tnodey{
18     short l,r,mid;
19     double max;
20 };
21 
22 struct tnodex{
23     short l,r,mid;
24     tnodey y[L<<2];
25 }T[H<<2];
26 
27 int x,y,n,x1,x2,y1,y2;
28 double delta,ty,ty1,ty2;
29 
30 double Max(double a,double b){return (a>b)?(a):(b);}
31 
32 void Buildy(int root,int i,int l,int r){
33     T[root].y[i].l = l; T[root].y[i].r = r; T[root].y[i].mid = (l+r)>>1;
34     T[root].y[i].max = -5;
35     if(l==r) return;
36     Buildy(root,Ch1,l,T[root].y[i].mid);Buildy(root,Ch2,T[root].y[i].mid+1,r);
37 }
38 
39 void Buildx(int i,int l,int r){
40     Buildy(i,1,0,L);
41     T[i].l = l; T[i].r = r; T[i].mid = (l+r)>>1;
42     if(l==r) return;
43     Buildx(Ch1,l,T[i].mid); Buildx(Ch2,T[i].mid+1,r);
44 }
45 
46 void Modifyy(int root,int i,int x,double delta){
47     if(T[root].y[i].l==T[root].y[i].r){
48         T[root].y[i].max = Max(T[root].y[i].max,delta);
49         return;
50     } 
51     if(x<=T[root].y[i].mid) Modifyy(root,Ch1,x,delta);
52     else                    Modifyy(root,Ch2,x,delta);
53     T[root].y[i].max = Max(T[root].y[Ch1].max,T[root].y[Ch2].max);
54 }
55 
56 void Modifyx(int i,int x,double delta){
57     Modifyy(i,1,y,delta);
58     if(T[i].l==T[i].r) return;
59     if(x<=T[i].mid) Modifyx(Ch1,x,delta);
60     else            Modifyx(Ch2,x,delta);
61 }
62 
63 double queryY(int root,int i,int l,int r){
64     if(l<=T[root].y[i].l&&T[root].y[i].r<=r) return T[root].y[i].max;
65     if(r<=T[root].y[i].mid)  return queryY(root,Ch1,l,r);else
66     if(l>T[root].y[i].mid)   return queryY(root,Ch2,l,r);else
67     return Max(queryY(root,Ch1,l,T[root].y[i].mid),queryY(root,Ch2,T[root].y[i].mid+1,r));
68 }
69 
70 double queryX(int i,int l,int r){
71     if(l<=T[i].l&&T[i].r<=r) return queryY(i,1,y1,y2);
72     if(r<=T[i].mid) return queryX(Ch1,l,r);
73     if(l>T[i].mid)  return queryX(Ch2,l,r);
74     return Max(queryX(Ch1,l,T[i].mid),queryX(Ch2,T[i].mid+1,r));
75 }
76 
77 int main(){
78     scanf("%d",&n);
79     while(n){
80         Buildx(1,100,H);
81         For(i,n){
82             char op;
83             scanf("\n");scanf("%c",&op);
84             if(op==‘I‘) {
85                 scanf("%d%lf%lf",&x,&ty,&delta);y = ty*10;
86                 Modifyx(1,x,delta);
87             }else{
88                 scanf("%d%d%lf%lf",&x1,&x2,&ty1,&ty2);y1 = ty1*10; y2 = ty2*10;
89                 if(x1>x2) swap(x1,x2); if(y1>y2) swap(y1,y2);
90                 double ans = queryX(1,x1,x2);
91                 if(ans<0)  puts("-1");
92                 else       printf("%.1lf\n",ans);
93                 
94             }   
95         }
96         scanf("%d",&n);
97     }
98     return 0;
99 }