#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 3005;

int n;
deque < int > q;

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> n;
  while ( n -- ) {
    int op;
    cin >> op;
    if ( op == 1 ) {
      int x;
      cin >> x;
      q.push_front ( x );
    }
    else if ( op == 2 ) {
      int x;
      cin >> x;
      q.push_back ( x );
    }
    else if ( op == 3 ) {
      q.pop_front ();
    }
    else if ( op == 4 ) {
      q.pop_back ();
    }
    else if ( op == 5 ) {
      int k, c;
      cin >> k >> c;
      int ans = 0;
      for ( int i = 0, j = 1; i < q.size (), j <= c; i += k, j ++ ) {
        ans += q[i];
      }
      cout << ans << '\n';
    }
    else {
      int k, c;
      cin >> k >> c;
      int ans = 0;
      for ( int i = q.size () - 1, j = 1; i >= 0, j <= c; i -= k, j ++ ) {
        ans += q[i];
      }
      cout << ans << '\n';
    }
  }
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}