ueue songman

#include <bits/stdc++.h>

using namespace std;
using LINT = long long int;
using PII = pair<int,int>;

#define PB push_back
#define FI first
#define SE second
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)

int q;
deque<int> d;
bool rev=false;

int main() {
    cin>>q;
    REP(i,q){
        string s;
        cin>>s;
        if(s=="toFront"){
            int n;cin>>n;
            if(rev)d.push_back(n);
            else d.push_front(n);
        }
        else if(s=="push_back"){
            int n;cin>>n;
            if(rev)d.push_front(n);
            else d.push_back(n);
        }
        else if(s=="reverse")
            rev = !rev;
        else if(s=="front"){
            if(d.size()){
                if(rev){
                    cout<<d.back()<<endl;
                    d.pop_back();
                }
                else {
                    cout<<d.front()<<endl;
                    d.pop_front();
                }
            }
            else cout<<"No job for Ada?"<<endl;
        }
        else if(s=="back"){
            if(d.size()){
                if(rev){
                    cout<<d.front()<<endl;
                    d.pop_front();
                }
                else {
                    cout<<d.back()<<endl;
                    d.pop_back();
                }
            }
            else cout<<"No job for Ada?"<<endl;
        }
    }

    return 0;
}