#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3e6+2;
struct node{
	int ft,pt,x;	
};
node nd[N];
int T;
int op,u;
int ttop=0,ttback=1;
int cnt=1,x,sc,k,c,idx;
ll sum,cmt,td;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>T;
	nd[ttop].ft=-1;
	nd[ttop].pt=ttback;
	nd[ttback].ft=ttop;
	nd[ttback].pt=-1;
	while(T--){
		cin>>op;
		if(op==1){
			cin>>x;
			cnt++;
			nd[cnt].x=x;
			nd[cnt].ft=ttop;
			nd[cnt].pt=nd[ttop].pt;
			nd[nd[ttop].pt].ft=cnt;
			nd[ttop].pt=cnt;
		}
		if(op==2){
			cin>>x;
			cnt++;
			nd[cnt].x=x;
			nd[cnt].ft=nd[ttback].ft;
			nd[cnt].pt=ttback;
			nd[nd[ttback].ft].pt=cnt;
			nd[ttback].ft=cnt;
		}
		if(op==3){
			sc=nd[ttop].pt;
			nd[nd[sc].pt].ft=ttop;
			nd[ttop].pt=nd[sc].pt;
		}
		if(op==4){
			sc=nd[ttback].ft;
			nd[nd[sc].ft].pt=ttback;
			nd[ttback].ft=nd[sc].ft;
		}
		if(op==5){
			//从前到后
			cin>>k>>c;
			idx=nd[ttop].pt;
			sum=0,cmt=0,td=0;
			while(idx!=ttback){
				cmt++;
				if(cmt%k==1){
					sum+=nd[idx].x;
					td++;
					if(td==c)break;
				}
				idx=nd[idx].pt; 
			}
			cout<<sum<<'\n';
		}
		if(op==6){
			//从后到前
			cin>>k>>c;
			idx=nd[ttback].ft;
			sum=0,cmt=0,td=0;
			while(idx!=ttop){
				cmt++;
				if(cmt%k==1){
					sum+=nd[idx].x;
					td++;
					if(td==c)break;
				}
				idx=nd[idx].ft; 
			}
			cout<<sum<<'\n';
		}
	}
	return 0;
}