#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define MAXN 140100
#define inf 70000
using namespace std;
inline int read()
{int s=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();while(ch>='0'&&ch<='9'){s=(s<<3)+(s<<1)+ch-48;ch=getchar();}return s;
}
const double alpha=0.75;
struct Tree
{Tree *ch[2];int size,l,r,mid;
}*null,*stack[120*MAXN],pool[120*MAXN],*now[MAXN];
int Now[MAXN],num,Num;
int list[MAXN],len;
int top;
struct ScapeGoat_Tree
{ScapeGoat_Tree *ch[2];int size,key;Tree *root;bool bad(){return size*alpha+5<ch[0]->size||size*alpha+5<ch[1]->size;}void pushup(){size=ch[0]->size+ch[1]->size+1;}
}*Null,*root,*lst[MAXN],node[MAXN];
int sz;
inline void Init()
{null=pool;null->size=null->l=null->r=null->mid=0;null->ch[1]=null->ch[0]=null;for(int i=1;i<(100*MAXN);i++)stack[++top]=pool+i;Null=node;Null->size=Null->key=0;Null->ch[1]=Null->ch[0]=Null;Null->root=null;root=Null;
}
inline Tree *New(int l,int r)
{Tree *p=stack[top--];p->l=l;p->r=r;p->mid=(l+r)>>1;p->size=0;p->ch[0]=p->ch[1]=null;return p;
}
inline ScapeGoat_Tree *New(int key)
{ScapeGoat_Tree *p=&node[++sz];p->ch[0]=p->ch[1]=Null;p->size=1;p->key=key;p->root=null;return p;
}
void recovery(Tree *p)
{if(p==null)return;recovery(p->ch[0]);stack[++top]=p;recovery(p->ch[1]);
}
void travel(ScapeGoat_Tree *p)
{if(p==Null)return;travel(p->ch[0]);lst[++len]=p;list[len]=p->key;recovery(p->root);p->root=null;travel(p->ch[1]);
}
void ins(Tree *&p,int key,int l,int r)
{if(p==null)p=New(l,r);p->size++;if(p->l==p->r)return;if(p->mid<key) ins(p->ch[1],key,p->mid+1,r);else ins(p->ch[0],key,l,p->mid);
}
ScapeGoat_Tree *divide(int l,int r)
{if(l>r)return Null;int mid=(l+r)>>1;for(int i=l;i<=r;i++)ins(lst[mid]->root,list[i],0,inf);lst[mid]->ch[0]=divide(l,mid-1);lst[mid]->ch[1]=divide(mid+1,r);lst[mid]->pushup();return lst[mid];
}
void Ins(ScapeGoat_Tree *p,int key,int pos)
{ins(p->root,key,0,inf);if(p->ch[0]->size+1==pos){p->key=key;return;}if(p->ch[0]->size>=pos)Ins(p->ch[0],key,pos);else Ins(p->ch[1],key,pos-p->ch[0]->size-1);
}
inline void rebuild(ScapeGoat_Tree *&p)
{len=0;travel(p);p=divide(1,len);
}
ScapeGoat_Tree **insert(ScapeGoat_Tree *&p,int key,int pos)
{if(p==Null){p=New(key);ins(p->root,key,0,inf);return &Null;}p->size++;ins(p->root,key,0,inf);ScapeGoat_Tree **ret;if(p->ch[0]->size+1>=pos)ret=insert(p->ch[0],key,pos);else ret=insert(p->ch[1],key,pos-p->ch[0]->size-1);if(p->bad())ret=&p;return ret;
}
inline void Insert(int key,int pos)
{ScapeGoat_Tree **p=insert(root,key,pos);if(*p!=Null)rebuild(*p);
}
inline int find(int pos)
{ScapeGoat_Tree *p=root;while(1)if(p->ch[0]->size+1==pos)return p->key;else if(p->ch[0]->size>=pos)p=p->ch[0];else pos-=p->ch[0]->size+1,p=p->ch[1];
}
void del(Tree *&p,int key)
{p->size--;if(p->l==p->r){if(p->size==0){stack[++top]=p;p=null;}return;}del(p->ch[p->mid<key],key);if(p->size==0){stack[++top]=p;p=null;}
}
void Del(ScapeGoat_Tree *p,int pos,int key)
{del(p->root,key);if(p->ch[0]->size+1==pos)return;if(p->ch[0]->size>=pos)Del(p->ch[0],pos,key);else Del(p->ch[1],pos-p->ch[0]->size-1,key);
}
int rank(Tree *p,int key)
{if(p==null)return 0;if(p->l==p->r)return 0;if(key<=p->mid)return rank(p->ch[0],key);else return p->ch[0]->size+rank(p->ch[1],key);
}
void pre(ScapeGoat_Tree *p,int l,int r)
{if(p==Null)return;if(l<=1&&p->size<=r){now[++num]=p->root; return;}if(l<=p->ch[0]->size)pre(p->ch[0],l,r);if(l<=p->ch[0]->size+1&&r>=p->ch[0]->size+1)Now[++Num]=p->key;if(p->ch[0]->size+1<r)pre(p->ch[1],l-p->ch[0]->size-1,r-p->ch[0]->size-1);
}
inline int Rank(int x)
{int ans=0;for(int i=1;i<=num;i++)ans+=rank(now[i],x);for(int i=1;i<=Num;i++)if(x>Now[i])ans++;else break;return ans;
}
int lastans=0;
inline void work1()
{int x=read()^lastans,y=read()^lastans,k=read()^lastans;if(x>y)x^=y^=x^=y;num=Num=0;pre(root,x,y);sort(Now+1,Now+Num+1);int l=0,r=inf,ans=0;while(l<=r){int mid=(l+r)>>1;int tmp=Rank(mid)+1;if(tmp<=k)ans=mid,l=mid+1;elser=mid-1;}lastans=ans;printf("%d\n",ans);
}
inline void work2()
{int x=read()^lastans,val=read()^lastans;Del(root,x,find(x));Ins(root,val,x);
}
inline void work3()
{int x=read()^lastans,val=read()^lastans;Insert(val,x);
}
int main()
{Init();int n=read();for(int i=1;i<=n;i++){list[++len]=read();lst[len]=New(list[len]);}root=divide(1,len);int Q=read();while(Q--){char s[2];scanf("%s",s);if(s[0]=='Q')work1();if(s[0]=='M')work2();if(s[0]=='I')work3();}return 0;
}