#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() {
    int n = 6;

    for (int i = 1; i <= n; i++) {
        enque(i);
    }

    while (size() > 1) {
        deque();       
        enque(deque());
    }

    printf("%d\n", deque());
}