#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 size(){
    return rear - front;
}

int main() {
    int arr[] = {3, 1, 5, 2};
    int n = 4;

    for (int i = 0; i < n; i++) {
        enque(arr[i]);
    }

    int time = 0;

    for (int i = 0;i < n;i++) {
        int items = deque();
        time += items;
    }
    
    printf("%d", time);

    return 0;
}