Throwing Cards Away

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int q[1<<17],b,e,N;
int main(void){
    while(scanf("%d",&N),N){
        iota(q,q+N,1);
        b=0,e=N-1;
        printf("Discarded cards:");
        while(b<e){
            if(b)putchar_unlocked(',');
            printf(" %d",q[b++]);
            q[++e]=q[b++];
        }
        putchar_unlocked(10);
        printf("Remaining card: %d\n",q[e]);
    }
    return 0;
}