#include <stdio.h>

int front = 0;
int rear = 0;
int que[100] = {};

void enqueue(int x) {
    que[rear++] = x;
}

int dequeue() {
    return que[front++];
}

int empty() {
    return front == rear;
}

int size() {
    return rear - front;
}

int Front() {
    if (empty())
        return 1;
    return que[front];
}

int Rear() {
    if (empty())
        return 1;
    return que[rear-1];
}

int main() {
    enqueue(5);
    enqueue(3);
    printf("%d\n", Front());
    printf("%d\n", Rear()); 
    dequeue();
    printf("%d\n", Front());
}