2164 카드2

#include <stdio.h>
#include <queue>
 
using namespace std;
 
int main() {
    int n;
    scanf("%d", &n);
 
    queue<int> q;
    for (int i = 1; i <= n; i++) 
        q.push(i);
    
    while (q.size() > 0) {
        if(q.size()==1)
            printf("%d ", q.front());
        q.pop();
 
        if (q.size() > 0) {
            q.push(q.front());
            q.pop();
        }
    }
}