#include <stdio.h>

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

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

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

int empty(){
    if (front == rear) {
        return 0;
    }
    return 1;
}

int size(){
    return rear - front;
}

int main() {
    enque(7);
    enque(10);
    printf("%d\n",deque());
    printf("%d\n",size());
    printf("%d\n",deque());
    if (empty() == 0) {
        printf("empty");
    }else{
        printf("some");
    }
    return 0;
}