#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 #include<queue>

 using namespace std;

 queue<int>q;

 int main()

 {

     int i,j,n,ans,a,b;

     while(scanf("%d",&n)!=EOF&&n)

     {

         while(!q.empty()) q.pop();

         for(i=;i<=n;i++)

         q.push(i);

         printf("Discarded cards:");

         while(q.size()!=)

         {

             b=q.front();q.pop();

             if(q.size()!=) printf(" %d,",b);

             else printf(" %d",b);

             a=q.front();q.pop();

             q.push(a);

         }

         printf("\n");

         printf("Remaining card: %d\n",q.front());

     }

 }