#include <stdio.h>
#include <string.h>
int deque[MAX];
int front =-1,rear=-1,size;
int isFull(){
    return ((front == 0&& rear == size -1) || (front == rear +1));
}
int isEmpty(){
    return (front == -1);
}
void insertFront(int x){
    if(isFull()) return;
    if(front==-1){
        front =rear =0;
    }
    else if(front == 0){
        front size-1;
    }
    else{
        front--;
    }
    deque[front]=x;
}
void insertLast(int x){
    if(isFull()) return;
    if(front == -1){
        front =rear=0;
    }
    else if(rear ==size-1){
        rear =0;
    }else{
        rear++;
    }
    deque[rear] =x;
void deleteFront(){
    if(isEmpty()) return;
    if(front == rear){
        front =rear =-1;
    }
    else if(front ==size-1){
        front =0;
    }else{
        front++;
    }
}
void deleteLast(){
    if(isEmpty())return;
    if(front == rear){
        front =rear=-1;
    }
    else if(rear ==0){
        rear =size-2;
    }else{
        rear--;
    }
}
int getFront(){
    if(isEmpty())return -1;
    return deque[front];
}int getRear(){
    if(isEmpty()) return -1;
    return deque[rear];
}
int main(){
    char op[20];
    int x;
    scanf("%d",&size);
    
    while(scanf("%s",op) != EOF){
        if(strcmp(op,"inserFront") ==0){
            scanf("%d",&x);
            insertFront(x);
        }
         else if(strcmp(op,"insetLast") ==0){
            scanf("%d",&x);
            insertLast(x);
        }
        else if(strcmp(op,"deleteFront") ==0){
            deleteFront();
        }
        else if(strcmp(op,"deleteLast") ==0){
            deleteLast();
        }
        else if(strcmp(op,"getFront") ==0){
            printf("%d\n",getFront());
        }
        else if(strcmp(op,"grtRear") ==0){
            printf("%d\n",getRear());
        }
        else if(strcmp(op,"isEmpty") ==0){
            printf("%s\n",isEmpty()? "true":"false");
        }
        else if(strcmp(op,"isFull") ==0){
            printf("%s\n",isFull() ? "true": "false");
        }
        
            
    }
    return 0;
}