QUEUE

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
char s[1024];
deque<int> q;
int a,x;
bool ck(){if(!q.empty())return 1;return puts("No job for Ada?"),0;}
int bk(){
    if(!x)a=q.back(),q.pop_back();
    else a=q.front(),q.pop_front();
    return a;
}
int fr(){return x^=1,a=bk(),x^=1,a;}
void pb(int a){
    if(x)q.push_front(a);
    else q.push_back(a);
}
int main(void){
    IN(tt)F(tt){
        scanf("%s",s);
        if(*s==98){if(ck())printf("%d\n",bk());}
        if(*s=='f'){if(ck())printf("%d\n",fr());}
        if(*s=='r')x^=1;
        if(*s==112)scanf("%d",&a),pb(a),assert(a>=0&&a<101);
        if(*s=='t')scanf("%d",&a),x^=1,pb(a),x^=1,assert(a>=0&&a<101);
    }
    assert(tt<1e6+1);
    return 0;
}